./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.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/per-thread-struct.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 b9f8638b837f9d4f066ca2de5a13579053f042517f09bc86f1b9882385463239 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:11:14,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:11:14,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:11:14,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:11:14,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:11:14,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:11:14,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:11:14,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:11:14,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:11:14,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:11:14,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:11:14,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:11:14,958 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:11:14,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:11:14,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:11:14,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:11:14,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:11:14,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:11:14,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:11:14,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:11:14,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:11:14,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:11:14,959 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:11:14,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:11:14,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:11:14,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:11:14,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:11:14,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:11:14,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:11:14,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:11:14,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:11:14,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:11:14,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:11:14,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:11:14,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:11:14,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:11:14,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:11:14,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:11:14,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:11:14,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:11:14,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:11:14,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:11:14,960 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 -> b9f8638b837f9d4f066ca2de5a13579053f042517f09bc86f1b9882385463239 [2025-03-08 22:11:15,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:11:15,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:11:15,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:11:15,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:11:15,173 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:11:15,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2025-03-08 22:11:16,285 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218f3ebec/37b6ec51f1844822be9577a96f937247/FLAGa71cab7ee [2025-03-08 22:11:16,588 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:11:16,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2025-03-08 22:11:16,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218f3ebec/37b6ec51f1844822be9577a96f937247/FLAGa71cab7ee [2025-03-08 22:11:16,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218f3ebec/37b6ec51f1844822be9577a96f937247 [2025-03-08 22:11:16,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:11:16,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:11:16,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:11:16,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:11:16,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:11:16,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:11:16" (1/1) ... [2025-03-08 22:11:16,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f816a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:16, skipping insertion in model container [2025-03-08 22:11:16,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:11:16" (1/1) ... [2025-03-08 22:11:16,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:11:17,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:11:17,122 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:11:17,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:11:17,187 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:11:17,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:17 WrapperNode [2025-03-08 22:11:17,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:11:17,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:11:17,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:11:17,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:11:17,192 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:11:17" (1/1) ... [2025-03-08 22:11:17,200 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:11:17" (1/1) ... [2025-03-08 22:11:17,212 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-03-08 22:11:17,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:11:17,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:11:17,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:11:17,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:11:17,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:17" (1/1) ... [2025-03-08 22:11:17,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:17" (1/1) ... [2025-03-08 22:11:17,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:17" (1/1) ... [2025-03-08 22:11:17,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:17" (1/1) ... [2025-03-08 22:11:17,226 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:17" (1/1) ... [2025-03-08 22:11:17,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:17" (1/1) ... [2025-03-08 22:11:17,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:17" (1/1) ... [2025-03-08 22:11:17,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:17" (1/1) ... [2025-03-08 22:11:17,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:11:17,234 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:11:17,234 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:11:17,234 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:11:17,234 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:17" (1/1) ... [2025-03-08 22:11:17,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:11:17,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:11:17,256 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:11:17,257 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:11:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:11:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:11:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:11:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:11:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-08 22:11:17,272 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-08 22:11:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:11:17,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:11:17,272 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:11:17,353 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:11:17,354 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:11:17,536 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:11:17,537 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:11:17,547 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:11:17,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:11:17,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:17 BoogieIcfgContainer [2025-03-08 22:11:17,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:11:17,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:11:17,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:11:17,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:11:17,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:11:16" (1/3) ... [2025-03-08 22:11:17,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510efc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:11:17, skipping insertion in model container [2025-03-08 22:11:17,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:17" (2/3) ... [2025-03-08 22:11:17,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510efc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:11:17, skipping insertion in model container [2025-03-08 22:11:17,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:17" (3/3) ... [2025-03-08 22:11:17,555 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct.i [2025-03-08 22:11:17,564 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:11:17,565 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct.i that has 2 procedures, 81 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-08 22:11:17,565 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:11:17,602 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:11:17,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 83 transitions, 173 flow [2025-03-08 22:11:17,680 INFO L124 PetriNetUnfolderBase]: 2/115 cut-off events. [2025-03-08 22:11:17,682 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:11:17,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 115 events. 2/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 185 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 52. Up to 3 conditions per place. [2025-03-08 22:11:17,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 83 transitions, 173 flow [2025-03-08 22:11:17,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 173 flow [2025-03-08 22:11:17,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:17,700 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;@50ce7fbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:17,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-08 22:11:17,711 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:17,712 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-03-08 22:11:17,712 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:17,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:17,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:17,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-08 22:11:17,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1162077507, now seen corresponding path program 1 times [2025-03-08 22:11:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:17,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185278424] [2025-03-08 22:11:17,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:17,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:17,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:11:17,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:11:17,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:17,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:18,003 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:11:18,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:18,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185278424] [2025-03-08 22:11:18,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185278424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:18,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:18,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:18,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265183139] [2025-03-08 22:11:18,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:18,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:11:18,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:18,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:11:18,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:11:18,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 83 [2025-03-08 22:11:18,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 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:11:18,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:18,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 83 [2025-03-08 22:11:18,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:18,176 INFO L124 PetriNetUnfolderBase]: 1/120 cut-off events. [2025-03-08 22:11:18,176 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:11:18,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 120 events. 1/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 160 event pairs, 0 based on Foata normal form. 2/116 useless extension candidates. Maximal degree in co-relation 22. Up to 16 conditions per place. [2025-03-08 22:11:18,177 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 11 selfloop transitions, 2 changer transitions 6/87 dead transitions. [2025-03-08 22:11:18,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 87 transitions, 217 flow [2025-03-08 22:11:18,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 434 transitions. [2025-03-08 22:11:18,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8714859437751004 [2025-03-08 22:11:18,191 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 173 flow. Second operand 6 states and 434 transitions. [2025-03-08 22:11:18,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 87 transitions, 217 flow [2025-03-08 22:11:18,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:18,199 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 187 flow [2025-03-08 22:11:18,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2025-03-08 22:11:18,204 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 9 predicate places. [2025-03-08 22:11:18,204 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 187 flow [2025-03-08 22:11:18,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 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:11:18,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:18,204 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:11:18,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:11:18,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-08 22:11:18,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:18,205 INFO L85 PathProgramCache]: Analyzing trace with hash -95299855, now seen corresponding path program 1 times [2025-03-08 22:11:18,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:18,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381341600] [2025-03-08 22:11:18,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:18,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:18,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:11:18,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:11:18,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:18,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:18,537 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:11:18,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:18,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381341600] [2025-03-08 22:11:18,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381341600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:18,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:18,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:18,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020189405] [2025-03-08 22:11:18,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:18,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:18,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:18,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:18,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 83 [2025-03-08 22:11:18,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:11:18,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:18,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 83 [2025-03-08 22:11:18,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:18,791 INFO L124 PetriNetUnfolderBase]: 70/365 cut-off events. [2025-03-08 22:11:18,791 INFO L125 PetriNetUnfolderBase]: For 22/25 co-relation queries the response was YES. [2025-03-08 22:11:18,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 365 events. 70/365 cut-off events. For 22/25 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1715 event pairs, 35 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 504. Up to 150 conditions per place. [2025-03-08 22:11:18,794 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 23 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2025-03-08 22:11:18,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 319 flow [2025-03-08 22:11:18,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2025-03-08 22:11:18,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7911646586345381 [2025-03-08 22:11:18,799 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 187 flow. Second operand 6 states and 394 transitions. [2025-03-08 22:11:18,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 319 flow [2025-03-08 22:11:18,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 102 transitions, 305 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:18,801 INFO L231 Difference]: Finished difference. Result has 94 places, 102 transitions, 323 flow [2025-03-08 22:11:18,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=94, PETRI_TRANSITIONS=102} [2025-03-08 22:11:18,802 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 10 predicate places. [2025-03-08 22:11:18,802 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 323 flow [2025-03-08 22:11:18,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:11:18,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:18,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:18,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:11:18,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-08 22:11:18,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash 106171396, now seen corresponding path program 1 times [2025-03-08 22:11:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:18,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475599056] [2025-03-08 22:11:18,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:18,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:11:18,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:11:18,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:18,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:19,098 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:11:19,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:19,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475599056] [2025-03-08 22:11:19,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475599056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:19,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:19,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171462880] [2025-03-08 22:11:19,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:19,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:19,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:19,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:19,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:19,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 83 [2025-03-08 22:11:19,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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:11:19,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:19,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 83 [2025-03-08 22:11:19,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:19,274 INFO L124 PetriNetUnfolderBase]: 130/487 cut-off events. [2025-03-08 22:11:19,275 INFO L125 PetriNetUnfolderBase]: For 142/176 co-relation queries the response was YES. [2025-03-08 22:11:19,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 487 events. 130/487 cut-off events. For 142/176 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2429 event pairs, 23 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 987. Up to 238 conditions per place. [2025-03-08 22:11:19,280 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 33 selfloop transitions, 48 changer transitions 7/145 dead transitions. [2025-03-08 22:11:19,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 145 transitions, 641 flow [2025-03-08 22:11:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2025-03-08 22:11:19,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734939759036144 [2025-03-08 22:11:19,283 INFO L175 Difference]: Start difference. First operand has 94 places, 102 transitions, 323 flow. Second operand 6 states and 435 transitions. [2025-03-08 22:11:19,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 145 transitions, 641 flow [2025-03-08 22:11:19,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 145 transitions, 641 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:19,288 INFO L231 Difference]: Finished difference. Result has 104 places, 138 transitions, 697 flow [2025-03-08 22:11:19,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=697, PETRI_PLACES=104, PETRI_TRANSITIONS=138} [2025-03-08 22:11:19,289 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 20 predicate places. [2025-03-08 22:11:19,289 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 138 transitions, 697 flow [2025-03-08 22:11:19,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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:11:19,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:19,290 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] [2025-03-08 22:11:19,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:11:19,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-08 22:11:19,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:19,291 INFO L85 PathProgramCache]: Analyzing trace with hash -870616162, now seen corresponding path program 1 times [2025-03-08 22:11:19,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:19,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211032075] [2025-03-08 22:11:19,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:19,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 22:11:19,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 22:11:19,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:19,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:19,550 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:11:19,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:19,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211032075] [2025-03-08 22:11:19,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211032075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:19,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:19,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:19,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311764696] [2025-03-08 22:11:19,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:19,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:19,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:19,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:19,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:19,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 83 [2025-03-08 22:11:19,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 138 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 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:11:19,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:19,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 83 [2025-03-08 22:11:19,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:19,759 INFO L124 PetriNetUnfolderBase]: 142/522 cut-off events. [2025-03-08 22:11:19,759 INFO L125 PetriNetUnfolderBase]: For 548/675 co-relation queries the response was YES. [2025-03-08 22:11:19,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 522 events. 142/522 cut-off events. For 548/675 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2874 event pairs, 10 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 1481. Up to 241 conditions per place. [2025-03-08 22:11:19,762 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 73 selfloop transitions, 25 changer transitions 13/166 dead transitions. [2025-03-08 22:11:19,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 166 transitions, 1080 flow [2025-03-08 22:11:19,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2025-03-08 22:11:19,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8092369477911646 [2025-03-08 22:11:19,764 INFO L175 Difference]: Start difference. First operand has 104 places, 138 transitions, 697 flow. Second operand 6 states and 403 transitions. [2025-03-08 22:11:19,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 166 transitions, 1080 flow [2025-03-08 22:11:19,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 166 transitions, 1062 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:19,773 INFO L231 Difference]: Finished difference. Result has 107 places, 153 transitions, 914 flow [2025-03-08 22:11:19,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=107, PETRI_TRANSITIONS=153} [2025-03-08 22:11:19,774 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 23 predicate places. [2025-03-08 22:11:19,774 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 153 transitions, 914 flow [2025-03-08 22:11:19,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 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:11:19,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:19,775 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-08 22:11:19,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:11:19,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-08 22:11:19,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:19,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2118060071, now seen corresponding path program 1 times [2025-03-08 22:11:19,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:19,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143183250] [2025-03-08 22:11:19,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:19,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:19,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 22:11:19,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 22:11:19,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:19,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:19,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:11:19,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 22:11:19,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 22:11:19,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:19,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:19,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:11:19,825 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:11:19,826 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-08 22:11:19,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-03-08 22:11:19,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-03-08 22:11:19,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-03-08 22:11:19,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-03-08 22:11:19,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:11:19,830 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 22:11:19,831 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:11:19,832 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:11:19,850 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:11:19,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 102 transitions, 220 flow [2025-03-08 22:11:19,880 INFO L124 PetriNetUnfolderBase]: 4/198 cut-off events. [2025-03-08 22:11:19,880 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:11:19,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 198 events. 4/198 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 394 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 117. Up to 6 conditions per place. [2025-03-08 22:11:19,881 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 102 transitions, 220 flow [2025-03-08 22:11:19,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 102 transitions, 220 flow [2025-03-08 22:11:19,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:19,885 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;@50ce7fbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:19,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-08 22:11:19,890 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:19,890 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-03-08 22:11:19,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:19,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:19,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:19,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 22:11:19,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:19,893 INFO L85 PathProgramCache]: Analyzing trace with hash -523518659, now seen corresponding path program 1 times [2025-03-08 22:11:19,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:19,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591979469] [2025-03-08 22:11:19,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:19,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:19,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:11:19,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:11:19,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:19,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:19,952 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:11:19,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:19,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591979469] [2025-03-08 22:11:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591979469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:19,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:19,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:19,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882498481] [2025-03-08 22:11:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:19,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:11:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:19,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:11:19,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:11:20,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 102 [2025-03-08 22:11:20,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 102 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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:11:20,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:20,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 102 [2025-03-08 22:11:20,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:20,051 INFO L124 PetriNetUnfolderBase]: 3/203 cut-off events. [2025-03-08 22:11:20,051 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-08 22:11:20,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 203 events. 3/203 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 432 event pairs, 0 based on Foata normal form. 2/195 useless extension candidates. Maximal degree in co-relation 143. Up to 32 conditions per place. [2025-03-08 22:11:20,052 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 14 selfloop transitions, 2 changer transitions 6/107 dead transitions. [2025-03-08 22:11:20,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 272 flow [2025-03-08 22:11:20,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2025-03-08 22:11:20,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.880718954248366 [2025-03-08 22:11:20,054 INFO L175 Difference]: Start difference. First operand has 104 places, 102 transitions, 220 flow. Second operand 6 states and 539 transitions. [2025-03-08 22:11:20,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 272 flow [2025-03-08 22:11:20,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:20,055 INFO L231 Difference]: Finished difference. Result has 113 places, 101 transitions, 238 flow [2025-03-08 22:11:20,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=113, PETRI_TRANSITIONS=101} [2025-03-08 22:11:20,056 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 9 predicate places. [2025-03-08 22:11:20,056 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 101 transitions, 238 flow [2025-03-08 22:11:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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:11:20,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:20,056 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:11:20,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:11:20,056 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 22:11:20,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash 801288215, now seen corresponding path program 1 times [2025-03-08 22:11:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:20,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553306410] [2025-03-08 22:11:20,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:20,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:20,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:11:20,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:11:20,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:20,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:20,210 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:11:20,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:20,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553306410] [2025-03-08 22:11:20,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553306410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:20,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:20,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:20,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079203595] [2025-03-08 22:11:20,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:20,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:20,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:20,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:20,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:20,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 102 [2025-03-08 22:11:20,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 101 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 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:11:20,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:20,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 102 [2025-03-08 22:11:20,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:20,615 INFO L124 PetriNetUnfolderBase]: 902/2767 cut-off events. [2025-03-08 22:11:20,615 INFO L125 PetriNetUnfolderBase]: For 180/186 co-relation queries the response was YES. [2025-03-08 22:11:20,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4542 conditions, 2767 events. 902/2767 cut-off events. For 180/186 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 21387 event pairs, 529 based on Foata normal form. 0/2527 useless extension candidates. Maximal degree in co-relation 3139. Up to 1384 conditions per place. [2025-03-08 22:11:20,629 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 31 selfloop transitions, 38 changer transitions 0/139 dead transitions. [2025-03-08 22:11:20,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 139 transitions, 457 flow [2025-03-08 22:11:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 495 transitions. [2025-03-08 22:11:20,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8088235294117647 [2025-03-08 22:11:20,633 INFO L175 Difference]: Start difference. First operand has 113 places, 101 transitions, 238 flow. Second operand 6 states and 495 transitions. [2025-03-08 22:11:20,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 139 transitions, 457 flow [2025-03-08 22:11:20,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 139 transitions, 445 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-08 22:11:20,636 INFO L231 Difference]: Finished difference. Result has 115 places, 138 transitions, 480 flow [2025-03-08 22:11:20,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=115, PETRI_TRANSITIONS=138} [2025-03-08 22:11:20,637 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 11 predicate places. [2025-03-08 22:11:20,637 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 138 transitions, 480 flow [2025-03-08 22:11:20,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 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:11:20,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:20,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:20,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:11:20,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 22:11:20,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:20,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2042375175, now seen corresponding path program 1 times [2025-03-08 22:11:20,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:20,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961070359] [2025-03-08 22:11:20,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:20,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:20,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:11:20,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:11:20,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:20,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:20,859 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:11:20,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:20,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961070359] [2025-03-08 22:11:20,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961070359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:20,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:20,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:20,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066843995] [2025-03-08 22:11:20,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:20,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:20,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:20,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:20,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:20,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 102 [2025-03-08 22:11:20,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 138 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 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:11:20,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:20,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 102 [2025-03-08 22:11:20,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:21,432 INFO L124 PetriNetUnfolderBase]: 1866/4735 cut-off events. [2025-03-08 22:11:21,433 INFO L125 PetriNetUnfolderBase]: For 1553/1782 co-relation queries the response was YES. [2025-03-08 22:11:21,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10900 conditions, 4735 events. 1866/4735 cut-off events. For 1553/1782 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 37456 event pairs, 434 based on Foata normal form. 0/4427 useless extension candidates. Maximal degree in co-relation 8662. Up to 2580 conditions per place. [2025-03-08 22:11:21,456 INFO L140 encePairwiseOnDemand]: 83/102 looper letters, 63 selfloop transitions, 92 changer transitions 0/233 dead transitions. [2025-03-08 22:11:21,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 233 transitions, 1226 flow [2025-03-08 22:11:21,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 543 transitions. [2025-03-08 22:11:21,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8872549019607843 [2025-03-08 22:11:21,459 INFO L175 Difference]: Start difference. First operand has 115 places, 138 transitions, 480 flow. Second operand 6 states and 543 transitions. [2025-03-08 22:11:21,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 233 transitions, 1226 flow [2025-03-08 22:11:21,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 1226 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:21,470 INFO L231 Difference]: Finished difference. Result has 125 places, 225 transitions, 1316 flow [2025-03-08 22:11:21,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1316, PETRI_PLACES=125, PETRI_TRANSITIONS=225} [2025-03-08 22:11:21,471 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 21 predicate places. [2025-03-08 22:11:21,471 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 225 transitions, 1316 flow [2025-03-08 22:11:21,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 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:11:21,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:21,472 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] [2025-03-08 22:11:21,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:11:21,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 22:11:21,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1458813421, now seen corresponding path program 1 times [2025-03-08 22:11:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85392721] [2025-03-08 22:11:21,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:21,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 22:11:21,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 22:11:21,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:21,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:21,642 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:11:21,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:21,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85392721] [2025-03-08 22:11:21,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85392721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:21,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:21,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:21,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156701843] [2025-03-08 22:11:21,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:21,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:21,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:21,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:21,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:21,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 102 [2025-03-08 22:11:21,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 225 transitions, 1316 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 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:11:21,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:21,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 102 [2025-03-08 22:11:21,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:22,361 INFO L124 PetriNetUnfolderBase]: 2323/5703 cut-off events. [2025-03-08 22:11:22,362 INFO L125 PetriNetUnfolderBase]: For 5573/6281 co-relation queries the response was YES. [2025-03-08 22:11:22,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17625 conditions, 5703 events. 2323/5703 cut-off events. For 5573/6281 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 46166 event pairs, 291 based on Foata normal form. 2/5470 useless extension candidates. Maximal degree in co-relation 14127. Up to 3131 conditions per place. [2025-03-08 22:11:22,401 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 145 selfloop transitions, 76 changer transitions 0/298 dead transitions. [2025-03-08 22:11:22,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 298 transitions, 2250 flow [2025-03-08 22:11:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2025-03-08 22:11:22,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.826797385620915 [2025-03-08 22:11:22,403 INFO L175 Difference]: Start difference. First operand has 125 places, 225 transitions, 1316 flow. Second operand 6 states and 506 transitions. [2025-03-08 22:11:22,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 298 transitions, 2250 flow [2025-03-08 22:11:22,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 298 transitions, 2232 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:22,434 INFO L231 Difference]: Finished difference. Result has 135 places, 296 transitions, 2156 flow [2025-03-08 22:11:22,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2156, PETRI_PLACES=135, PETRI_TRANSITIONS=296} [2025-03-08 22:11:22,435 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 31 predicate places. [2025-03-08 22:11:22,435 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 296 transitions, 2156 flow [2025-03-08 22:11:22,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 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:11:22,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:22,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:22,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:11:22,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 22:11:22,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:22,436 INFO L85 PathProgramCache]: Analyzing trace with hash 641108895, now seen corresponding path program 1 times [2025-03-08 22:11:22,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:22,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253623158] [2025-03-08 22:11:22,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:22,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:22,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:11:22,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:11:22,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:22,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:22,791 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:11:22,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:22,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253623158] [2025-03-08 22:11:22,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253623158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:22,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:22,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:11:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202034871] [2025-03-08 22:11:22,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:22,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:11:22,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:22,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:11:22,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:11:23,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2025-03-08 22:11:23,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 296 transitions, 2156 flow. Second operand has 14 states, 14 states have (on average 64.57142857142857) internal successors, (904), 14 states have internal predecessors, (904), 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:11:23,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:23,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2025-03-08 22:11:23,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:26,029 INFO L124 PetriNetUnfolderBase]: 5554/12664 cut-off events. [2025-03-08 22:11:26,032 INFO L125 PetriNetUnfolderBase]: For 19942/21930 co-relation queries the response was YES. [2025-03-08 22:11:26,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42676 conditions, 12664 events. 5554/12664 cut-off events. For 19942/21930 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 112702 event pairs, 201 based on Foata normal form. 313/12688 useless extension candidates. Maximal degree in co-relation 31338. Up to 3786 conditions per place. [2025-03-08 22:11:26,097 INFO L140 encePairwiseOnDemand]: 78/102 looper letters, 691 selfloop transitions, 613 changer transitions 12/1383 dead transitions. [2025-03-08 22:11:26,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 1383 transitions, 12637 flow [2025-03-08 22:11:26,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-08 22:11:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-03-08 22:11:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 4687 transitions. [2025-03-08 22:11:26,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7069381598793364 [2025-03-08 22:11:26,105 INFO L175 Difference]: Start difference. First operand has 135 places, 296 transitions, 2156 flow. Second operand 65 states and 4687 transitions. [2025-03-08 22:11:26,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 1383 transitions, 12637 flow [2025-03-08 22:11:26,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 1383 transitions, 12161 flow, removed 238 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:26,181 INFO L231 Difference]: Finished difference. Result has 225 places, 948 transitions, 9073 flow [2025-03-08 22:11:26,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=9073, PETRI_PLACES=225, PETRI_TRANSITIONS=948} [2025-03-08 22:11:26,182 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 121 predicate places. [2025-03-08 22:11:26,182 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 948 transitions, 9073 flow [2025-03-08 22:11:26,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 64.57142857142857) internal successors, (904), 14 states have internal predecessors, (904), 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:11:26,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:26,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:26,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:11:26,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 22:11:26,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash -650180603, now seen corresponding path program 1 times [2025-03-08 22:11:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409429965] [2025-03-08 22:11:26,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:26,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:11:26,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:11:26,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:26,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:26,475 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:11:26,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:26,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409429965] [2025-03-08 22:11:26,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409429965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:26,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:26,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:11:26,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638327050] [2025-03-08 22:11:26,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:26,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:11:26,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:26,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:11:26,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:11:26,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2025-03-08 22:11:26,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 948 transitions, 9073 flow. Second operand has 14 states, 14 states have (on average 63.57142857142857) internal successors, (890), 14 states have internal predecessors, (890), 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:11:26,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:26,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2025-03-08 22:11:26,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:29,730 INFO L124 PetriNetUnfolderBase]: 6259/14427 cut-off events. [2025-03-08 22:11:29,730 INFO L125 PetriNetUnfolderBase]: For 87933/88714 co-relation queries the response was YES. [2025-03-08 22:11:29,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67479 conditions, 14427 events. 6259/14427 cut-off events. For 87933/88714 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 132123 event pairs, 117 based on Foata normal form. 303/14445 useless extension candidates. Maximal degree in co-relation 65948. Up to 4388 conditions per place. [2025-03-08 22:11:29,832 INFO L140 encePairwiseOnDemand]: 78/102 looper letters, 978 selfloop transitions, 461 changer transitions 16/1552 dead transitions. [2025-03-08 22:11:29,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 1552 transitions, 18669 flow [2025-03-08 22:11:29,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-08 22:11:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-08 22:11:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3107 transitions. [2025-03-08 22:11:29,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6922905525846702 [2025-03-08 22:11:29,837 INFO L175 Difference]: Start difference. First operand has 225 places, 948 transitions, 9073 flow. Second operand 44 states and 3107 transitions. [2025-03-08 22:11:29,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 1552 transitions, 18669 flow [2025-03-08 22:11:30,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 1552 transitions, 18290 flow, removed 185 selfloop flow, removed 3 redundant places. [2025-03-08 22:11:30,426 INFO L231 Difference]: Finished difference. Result has 277 places, 1194 transitions, 13095 flow [2025-03-08 22:11:30,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=8697, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=13095, PETRI_PLACES=277, PETRI_TRANSITIONS=1194} [2025-03-08 22:11:30,427 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 173 predicate places. [2025-03-08 22:11:30,427 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 1194 transitions, 13095 flow [2025-03-08 22:11:30,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 63.57142857142857) internal successors, (890), 14 states have internal predecessors, (890), 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:11:30,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:30,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:30,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:11:30,428 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 22:11:30,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash -717714635, now seen corresponding path program 2 times [2025-03-08 22:11:30,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:30,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924179310] [2025-03-08 22:11:30,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:11:30,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:30,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:11:30,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:11:30,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:11:30,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:30,767 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:11:30,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:30,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924179310] [2025-03-08 22:11:30,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924179310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:30,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:30,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:11:30,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33727234] [2025-03-08 22:11:30,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:30,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:11:30,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:30,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:11:30,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:11:31,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2025-03-08 22:11:31,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 1194 transitions, 13095 flow. Second operand has 14 states, 14 states have (on average 63.57142857142857) internal successors, (890), 14 states have internal predecessors, (890), 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:11:31,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:31,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2025-03-08 22:11:31,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:34,718 INFO L124 PetriNetUnfolderBase]: 6644/15588 cut-off events. [2025-03-08 22:11:34,718 INFO L125 PetriNetUnfolderBase]: For 143241/144773 co-relation queries the response was YES. [2025-03-08 22:11:34,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82682 conditions, 15588 events. 6644/15588 cut-off events. For 143241/144773 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 146804 event pairs, 240 based on Foata normal form. 358/15600 useless extension candidates. Maximal degree in co-relation 82010. Up to 4739 conditions per place. [2025-03-08 22:11:34,808 INFO L140 encePairwiseOnDemand]: 73/102 looper letters, 1079 selfloop transitions, 511 changer transitions 34/1721 dead transitions. [2025-03-08 22:11:34,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1721 transitions, 23059 flow [2025-03-08 22:11:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 22:11:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-08 22:11:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2603 transitions. [2025-03-08 22:11:34,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7088779956427015 [2025-03-08 22:11:34,811 INFO L175 Difference]: Start difference. First operand has 277 places, 1194 transitions, 13095 flow. Second operand 36 states and 2603 transitions. [2025-03-08 22:11:34,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 1721 transitions, 23059 flow [2025-03-08 22:11:35,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 1721 transitions, 22781 flow, removed 43 selfloop flow, removed 25 redundant places. [2025-03-08 22:11:35,501 INFO L231 Difference]: Finished difference. Result has 305 places, 1407 transitions, 17603 flow [2025-03-08 22:11:35,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=12875, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=313, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=17603, PETRI_PLACES=305, PETRI_TRANSITIONS=1407} [2025-03-08 22:11:35,503 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 201 predicate places. [2025-03-08 22:11:35,503 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 1407 transitions, 17603 flow [2025-03-08 22:11:35,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 63.57142857142857) internal successors, (890), 14 states have internal predecessors, (890), 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:11:35,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:35,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:35,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:11:35,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 22:11:35,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:35,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1295760683, now seen corresponding path program 3 times [2025-03-08 22:11:35,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:35,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221642399] [2025-03-08 22:11:35,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:11:35,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:35,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-03-08 22:11:35,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:11:35,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:11:35,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:35,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:35,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221642399] [2025-03-08 22:11:35,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221642399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:11:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030484374] [2025-03-08 22:11:35,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:11:35,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:11:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:11:35,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:11:35,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:11:35,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-03-08 22:11:35,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:11:35,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:11:35,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:35,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 22:11:35,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:11:35,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:11:36,023 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:11:36,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:11:36,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:11:36,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 22:11:36,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 22:11:36,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-08 22:11:36,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2025-03-08 22:11:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:36,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:11:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:37,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030484374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:11:37,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:11:37,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 39 [2025-03-08 22:11:37,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934653525] [2025-03-08 22:11:37,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:11:37,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 22:11:37,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:37,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 22:11:37,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1391, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 22:11:42,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:11:48,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:11:53,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:11:57,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:11:57,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 102 [2025-03-08 22:11:57,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 1407 transitions, 17603 flow. Second operand has 40 states, 40 states have (on average 56.9) internal successors, (2276), 40 states have internal predecessors, (2276), 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:11:57,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:57,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 102 [2025-03-08 22:11:57,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:09,022 INFO L124 PetriNetUnfolderBase]: 13100/29526 cut-off events. [2025-03-08 22:12:09,023 INFO L125 PetriNetUnfolderBase]: For 338879/343130 co-relation queries the response was YES. [2025-03-08 22:12:09,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177469 conditions, 29526 events. 13100/29526 cut-off events. For 338879/343130 co-relation queries the response was YES. Maximal size of possible extension queue 1196. Compared 300229 event pairs, 461 based on Foata normal form. 1302/30123 useless extension candidates. Maximal degree in co-relation 177002. Up to 9339 conditions per place. [2025-03-08 22:12:09,346 INFO L140 encePairwiseOnDemand]: 69/102 looper letters, 1708 selfloop transitions, 1577 changer transitions 121/3478 dead transitions. [2025-03-08 22:12:09,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 3478 transitions, 55441 flow [2025-03-08 22:12:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-08 22:12:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-08 22:12:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 3782 transitions. [2025-03-08 22:12:09,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6504987960096319 [2025-03-08 22:12:09,349 INFO L175 Difference]: Start difference. First operand has 305 places, 1407 transitions, 17603 flow. Second operand 57 states and 3782 transitions. [2025-03-08 22:12:09,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 3478 transitions, 55441 flow [2025-03-08 22:12:12,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 3478 transitions, 55057 flow, removed 156 selfloop flow, removed 17 redundant places. [2025-03-08 22:12:12,155 INFO L231 Difference]: Finished difference. Result has 372 places, 2548 transitions, 42551 flow [2025-03-08 22:12:12,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=17407, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=511, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=823, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=42551, PETRI_PLACES=372, PETRI_TRANSITIONS=2548} [2025-03-08 22:12:12,156 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 268 predicate places. [2025-03-08 22:12:12,156 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 2548 transitions, 42551 flow [2025-03-08 22:12:12,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 56.9) internal successors, (2276), 40 states have internal predecessors, (2276), 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:12,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:12,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:12:12,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:12:12,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 22:12:12,358 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 22:12:12,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1454004109, now seen corresponding path program 4 times [2025-03-08 22:12:12,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:12,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518330087] [2025-03-08 22:12:12,358 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:12:12,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:12,370 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 22:12:12,376 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:12:12,377 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 22:12:12,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:12,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:12,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518330087] [2025-03-08 22:12:12,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518330087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:12:12,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75833441] [2025-03-08 22:12:12,640 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:12:12,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:12:12,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:12:12,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:12:12,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:12:12,690 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 22:12:12,722 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:12:12,722 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 22:12:12,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:12,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 22:12:12,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:12:12,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:12:12,788 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:12:12,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:12:12,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:12:12,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 22:12:13,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 22:12:13,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-08 22:12:13,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2025-03-08 22:12:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:13,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:12:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:14,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75833441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:12:14,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:12:14,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 39 [2025-03-08 22:12:14,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691164808] [2025-03-08 22:12:14,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:12:14,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 22:12:14,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:14,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 22:12:14,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 22:12:22,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:12:26,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:12:26,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2025-03-08 22:12:26,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 2548 transitions, 42551 flow. Second operand has 40 states, 40 states have (on average 58.9) internal successors, (2356), 40 states have internal predecessors, (2356), 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:26,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:26,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2025-03-08 22:12:26,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:42,922 INFO L124 PetriNetUnfolderBase]: 13084/30293 cut-off events. [2025-03-08 22:12:42,922 INFO L125 PetriNetUnfolderBase]: For 640775/646043 co-relation queries the response was YES. [2025-03-08 22:12:43,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216445 conditions, 30293 events. 13084/30293 cut-off events. For 640775/646043 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 315183 event pairs, 437 based on Foata normal form. 1729/31172 useless extension candidates. Maximal degree in co-relation 215888. Up to 9896 conditions per place. [2025-03-08 22:12:43,491 INFO L140 encePairwiseOnDemand]: 69/102 looper letters, 1947 selfloop transitions, 1594 changer transitions 16/3648 dead transitions. [2025-03-08 22:12:43,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 3648 transitions, 70395 flow [2025-03-08 22:12:43,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-08 22:12:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-08 22:12:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 3841 transitions. [2025-03-08 22:12:43,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6606467148262813 [2025-03-08 22:12:43,495 INFO L175 Difference]: Start difference. First operand has 372 places, 2548 transitions, 42551 flow. Second operand 57 states and 3841 transitions. [2025-03-08 22:12:43,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 3648 transitions, 70395 flow [2025-03-08 22:12:49,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 3648 transitions, 67996 flow, removed 1089 selfloop flow, removed 24 redundant places. [2025-03-08 22:12:49,587 INFO L231 Difference]: Finished difference. Result has 424 places, 2975 transitions, 55718 flow [2025-03-08 22:12:49,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=40950, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=55718, PETRI_PLACES=424, PETRI_TRANSITIONS=2975} [2025-03-08 22:12:49,590 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 320 predicate places. [2025-03-08 22:12:49,590 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 2975 transitions, 55718 flow [2025-03-08 22:12:49,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 58.9) internal successors, (2356), 40 states have internal predecessors, (2356), 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:49,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:49,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:12:49,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:12:49,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 22:12:49,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-08 22:12:49,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:49,795 INFO L85 PathProgramCache]: Analyzing trace with hash -658567423, now seen corresponding path program 5 times [2025-03-08 22:12:49,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:49,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276553315] [2025-03-08 22:12:49,795 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 22:12:49,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:49,802 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 22:12:49,806 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:12:49,807 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:12:49,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat