./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.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 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:59:02,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:59:02,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:59:02,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:59:02,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:59:02,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:59:02,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:59:02,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:59:02,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:59:02,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:59:02,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:59:02,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:59:02,874 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:59:02,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:59:02,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:59:02,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:59:02,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:59:02,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:59:02,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:59:02,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:59:02,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:59:02,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:59:02,875 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:59:02,876 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:59:02,876 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:59:02,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:59:02,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:59:02,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:59:02,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:59:02,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:59:02,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:59:02,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:59:02,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:59:02,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:59:02,877 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:59:02,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:59:02,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:59:02,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:59:02,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:59:02,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:59:02,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:59:02,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:59:02,877 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 -> 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb [2025-03-13 21:59:03,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:59:03,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:59:03,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:59:03,143 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:59:03,144 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:59:03,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-13 21:59:04,343 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ed44062/ad06c298f8634613b41e1f24be79ebeb/FLAG85c0c647f [2025-03-13 21:59:04,615 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:59:04,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-13 21:59:04,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ed44062/ad06c298f8634613b41e1f24be79ebeb/FLAG85c0c647f [2025-03-13 21:59:04,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ed44062/ad06c298f8634613b41e1f24be79ebeb [2025-03-13 21:59:04,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:59:04,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:59:04,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:59:04,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:59:04,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:59:04,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:04,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f42b39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04, skipping insertion in model container [2025-03-13 21:59:04,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:04,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:59:04,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:59:04,902 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:59:04,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:59:04,982 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:59:04,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04 WrapperNode [2025-03-13 21:59:04,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:59:04,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:59:04,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:59:04,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:59:04,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:05,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:05,020 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 87 [2025-03-13 21:59:05,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:59:05,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:59:05,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:59:05,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:59:05,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:05,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:05,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:05,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:05,039 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:05,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:05,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:05,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:05,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:59:05,047 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:59:05,047 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:59:05,047 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:59:05,048 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04" (1/1) ... [2025-03-13 21:59:05,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:59:05,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:59:05,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:59:05,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:59:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 21:59:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:59:05,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:59:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:59:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:59:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:59:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:59:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:59:05,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:59:05,105 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:59:05,215 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:59:05,216 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:59:05,395 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:59:05,396 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:59:05,396 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:59:05,416 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:59:05,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:59:05 BoogieIcfgContainer [2025-03-13 21:59:05,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:59:05,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:59:05,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:59:05,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:59:05,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:59:04" (1/3) ... [2025-03-13 21:59:05,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d96a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:59:05, skipping insertion in model container [2025-03-13 21:59:05,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:59:04" (2/3) ... [2025-03-13 21:59:05,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d96a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:59:05, skipping insertion in model container [2025-03-13 21:59:05,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:59:05" (3/3) ... [2025-03-13 21:59:05,426 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-03-13 21:59:05,438 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:59:05,441 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-zero.i that has 2 procedures, 98 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-13 21:59:05,442 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:59:05,515 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:05,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 105 transitions, 214 flow [2025-03-13 21:59:05,589 INFO L124 PetriNetUnfolderBase]: 7/112 cut-off events. [2025-03-13 21:59:05,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:05,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 112 events. 7/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 135 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-03-13 21:59:05,595 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 105 transitions, 214 flow [2025-03-13 21:59:05,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 105 transitions, 214 flow [2025-03-13 21:59:05,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:05,616 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@844c3b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:05,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-13 21:59:05,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:05,631 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-03-13 21:59:05,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:59:05,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:05,632 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:05,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 21:59:05,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:05,638 INFO L85 PathProgramCache]: Analyzing trace with hash 958284842, now seen corresponding path program 1 times [2025-03-13 21:59:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:05,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725711794] [2025-03-13 21:59:05,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:05,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:59:05,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:59:05,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:05,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:05,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:05,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:59:05,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:59:05,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:05,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:05,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:05,788 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:05,789 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-13 21:59:05,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-13 21:59:05,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-13 21:59:05,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-13 21:59:05,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-13 21:59:05,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-13 21:59:05,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-13 21:59:05,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-13 21:59:05,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-13 21:59:05,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:59:05,794 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-13 21:59:05,796 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:05,798 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:59:05,873 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:05,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 175 transitions, 360 flow [2025-03-13 21:59:05,917 INFO L124 PetriNetUnfolderBase]: 14/191 cut-off events. [2025-03-13 21:59:05,917 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:59:05,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 191 events. 14/191 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 461 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 147. Up to 3 conditions per place. [2025-03-13 21:59:05,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 175 transitions, 360 flow [2025-03-13 21:59:05,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 175 transitions, 360 flow [2025-03-13 21:59:05,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:05,928 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;@844c3b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:05,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-13 21:59:05,944 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:05,944 INFO L124 PetriNetUnfolderBase]: 1/70 cut-off events. [2025-03-13 21:59:05,944 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:59:05,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:05,945 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:05,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 21:59:05,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:05,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1526680402, now seen corresponding path program 1 times [2025-03-13 21:59:05,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:05,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153606635] [2025-03-13 21:59:05,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:05,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:05,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 21:59:05,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 21:59:05,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:05,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:05,976 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:05,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 21:59:05,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 21:59:05,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:05,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:05,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:05,997 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:05,998 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-13 21:59:05,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-13 21:59:05,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-13 21:59:05,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-13 21:59:06,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-13 21:59:06,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-13 21:59:06,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-13 21:59:06,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-13 21:59:06,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-13 21:59:06,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-13 21:59:06,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-13 21:59:06,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-13 21:59:06,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-13 21:59:06,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:59:06,001 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-13 21:59:06,002 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:06,002 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:59:06,051 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:06,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 245 transitions, 508 flow [2025-03-13 21:59:06,105 INFO L124 PetriNetUnfolderBase]: 21/270 cut-off events. [2025-03-13 21:59:06,105 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:59:06,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 270 events. 21/270 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 853 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 216. Up to 4 conditions per place. [2025-03-13 21:59:06,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 245 transitions, 508 flow [2025-03-13 21:59:06,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 245 transitions, 508 flow [2025-03-13 21:59:06,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:06,114 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;@844c3b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:06,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-13 21:59:06,123 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:06,123 INFO L124 PetriNetUnfolderBase]: 2/99 cut-off events. [2025-03-13 21:59:06,124 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:59:06,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:06,124 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:06,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 21:59:06,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:06,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1885533173, now seen corresponding path program 1 times [2025-03-13 21:59:06,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:06,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117275451] [2025-03-13 21:59:06,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:06,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:06,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 21:59:06,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 21:59:06,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:06,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:06,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:06,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 21:59:06,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 21:59:06,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:06,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:06,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:06,168 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:06,168 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-13 21:59:06,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-03-13 21:59:06,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-03-13 21:59:06,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-03-13 21:59:06,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-03-13 21:59:06,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-03-13 21:59:06,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2025-03-13 21:59:06,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-03-13 21:59:06,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-03-13 21:59:06,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-03-13 21:59:06,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-03-13 21:59:06,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-03-13 21:59:06,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-03-13 21:59:06,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-03-13 21:59:06,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-03-13 21:59:06,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-03-13 21:59:06,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-03-13 21:59:06,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:59:06,171 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-13 21:59:06,171 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:06,172 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 21:59:06,247 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:06,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 296 places, 315 transitions, 658 flow [2025-03-13 21:59:06,295 INFO L124 PetriNetUnfolderBase]: 28/349 cut-off events. [2025-03-13 21:59:06,296 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:59:06,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 349 events. 28/349 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1277 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 285. Up to 5 conditions per place. [2025-03-13 21:59:06,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 296 places, 315 transitions, 658 flow [2025-03-13 21:59:06,306 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 315 transitions, 658 flow [2025-03-13 21:59:06,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:06,307 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;@844c3b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:06,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-13 21:59:06,319 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:06,319 INFO L124 PetriNetUnfolderBase]: 3/133 cut-off events. [2025-03-13 21:59:06,319 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-13 21:59:06,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:06,319 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] [2025-03-13 21:59:06,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 21:59:06,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:06,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1582218942, now seen corresponding path program 1 times [2025-03-13 21:59:06,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:06,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7028354] [2025-03-13 21:59:06,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:06,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:06,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-13 21:59:06,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-13 21:59:06,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:06,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:06,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:06,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7028354] [2025-03-13 21:59:06,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7028354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:06,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:06,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:06,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403270324] [2025-03-13 21:59:06,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:06,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:06,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:06,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:06,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:06,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 315 [2025-03-13 21:59:06,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 315 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:06,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:06,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 315 [2025-03-13 21:59:06,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:07,724 INFO L124 PetriNetUnfolderBase]: 1135/6707 cut-off events. [2025-03-13 21:59:07,725 INFO L125 PetriNetUnfolderBase]: For 1363/1363 co-relation queries the response was YES. [2025-03-13 21:59:07,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 6707 events. 1135/6707 cut-off events. For 1363/1363 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 70757 event pairs, 690 based on Foata normal form. 1386/7106 useless extension candidates. Maximal degree in co-relation 2215. Up to 1091 conditions per place. [2025-03-13 21:59:07,795 INFO L140 encePairwiseOnDemand]: 299/315 looper letters, 27 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2025-03-13 21:59:07,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 301 transitions, 709 flow [2025-03-13 21:59:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2025-03-13 21:59:07,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9439153439153439 [2025-03-13 21:59:07,813 INFO L175 Difference]: Start difference. First operand has 296 places, 315 transitions, 658 flow. Second operand 3 states and 892 transitions. [2025-03-13 21:59:07,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 301 transitions, 709 flow [2025-03-13 21:59:07,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 301 transitions, 697 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:07,826 INFO L231 Difference]: Finished difference. Result has 287 places, 292 transitions, 616 flow [2025-03-13 21:59:07,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=287, PETRI_TRANSITIONS=292} [2025-03-13 21:59:07,832 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -9 predicate places. [2025-03-13 21:59:07,833 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 292 transitions, 616 flow [2025-03-13 21:59:07,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:07,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:07,833 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:07,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:59:07,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 21:59:07,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:07,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1097030549, now seen corresponding path program 1 times [2025-03-13 21:59:07,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:07,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131326022] [2025-03-13 21:59:07,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:07,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:07,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 21:59:07,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 21:59:07,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:07,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:07,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 21:59:07,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 21:59:07,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:07,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:07,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:07,868 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:07,868 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-03-13 21:59:07,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2025-03-13 21:59:07,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2025-03-13 21:59:07,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2025-03-13 21:59:07,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2025-03-13 21:59:07,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2025-03-13 21:59:07,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2025-03-13 21:59:07,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2025-03-13 21:59:07,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2025-03-13 21:59:07,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2025-03-13 21:59:07,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2025-03-13 21:59:07,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2025-03-13 21:59:07,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2025-03-13 21:59:07,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2025-03-13 21:59:07,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2025-03-13 21:59:07,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2025-03-13 21:59:07,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2025-03-13 21:59:07,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2025-03-13 21:59:07,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2025-03-13 21:59:07,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2025-03-13 21:59:07,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2025-03-13 21:59:07,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:59:07,870 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 21:59:07,870 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:07,870 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-13 21:59:07,927 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:07,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 361 places, 385 transitions, 810 flow [2025-03-13 21:59:07,970 INFO L124 PetriNetUnfolderBase]: 35/428 cut-off events. [2025-03-13 21:59:07,970 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-13 21:59:07,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 428 events. 35/428 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1725 event pairs, 0 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 362. Up to 6 conditions per place. [2025-03-13 21:59:07,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 361 places, 385 transitions, 810 flow [2025-03-13 21:59:07,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 361 places, 385 transitions, 810 flow [2025-03-13 21:59:07,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:07,980 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;@844c3b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:07,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-13 21:59:07,987 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:07,988 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2025-03-13 21:59:07,988 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-13 21:59:07,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:07,988 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] [2025-03-13 21:59:07,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 21:59:07,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:07,988 INFO L85 PathProgramCache]: Analyzing trace with hash -125146824, now seen corresponding path program 1 times [2025-03-13 21:59:07,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:07,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553237934] [2025-03-13 21:59:07,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:07,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:07,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-13 21:59:08,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-13 21:59:08,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:08,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:08,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553237934] [2025-03-13 21:59:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553237934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:08,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:08,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:08,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117491999] [2025-03-13 21:59:08,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:08,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:08,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:08,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:08,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 385 [2025-03-13 21:59:08,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 385 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:08,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:08,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 385 [2025-03-13 21:59:08,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:11,633 INFO L124 PetriNetUnfolderBase]: 4345/23597 cut-off events. [2025-03-13 21:59:11,633 INFO L125 PetriNetUnfolderBase]: For 6661/6661 co-relation queries the response was YES. [2025-03-13 21:59:11,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30277 conditions, 23597 events. 4345/23597 cut-off events. For 6661/6661 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 310471 event pairs, 2796 based on Foata normal form. 5339/25546 useless extension candidates. Maximal degree in co-relation 8478. Up to 4007 conditions per place. [2025-03-13 21:59:12,142 INFO L140 encePairwiseOnDemand]: 366/385 looper letters, 33 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-03-13 21:59:12,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 369 transitions, 880 flow [2025-03-13 21:59:12,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1093 transitions. [2025-03-13 21:59:12,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9463203463203463 [2025-03-13 21:59:12,145 INFO L175 Difference]: Start difference. First operand has 361 places, 385 transitions, 810 flow. Second operand 3 states and 1093 transitions. [2025-03-13 21:59:12,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 369 transitions, 880 flow [2025-03-13 21:59:12,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 369 transitions, 856 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:12,158 INFO L231 Difference]: Finished difference. Result has 350 places, 357 transitions, 752 flow [2025-03-13 21:59:12,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=350, PETRI_TRANSITIONS=357} [2025-03-13 21:59:12,159 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -11 predicate places. [2025-03-13 21:59:12,160 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 357 transitions, 752 flow [2025-03-13 21:59:12,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:12,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:12,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:12,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:59:12,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 21:59:12,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:12,162 INFO L85 PathProgramCache]: Analyzing trace with hash -924055654, now seen corresponding path program 1 times [2025-03-13 21:59:12,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:12,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553350057] [2025-03-13 21:59:12,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:12,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:12,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 21:59:12,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 21:59:12,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:12,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:12,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:12,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553350057] [2025-03-13 21:59:12,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553350057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:12,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:12,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955243215] [2025-03-13 21:59:12,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:12,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:12,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:12,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:12,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:12,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 385 [2025-03-13 21:59:12,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 357 transitions, 752 flow. Second operand has 6 states, 6 states have (on average 338.6666666666667) internal successors, (2032), 6 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:12,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:12,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 385 [2025-03-13 21:59:12,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:17,664 INFO L124 PetriNetUnfolderBase]: 7356/32165 cut-off events. [2025-03-13 21:59:17,664 INFO L125 PetriNetUnfolderBase]: For 4926/4926 co-relation queries the response was YES. [2025-03-13 21:59:17,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42833 conditions, 32165 events. 7356/32165 cut-off events. For 4926/4926 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 428160 event pairs, 2472 based on Foata normal form. 0/28083 useless extension candidates. Maximal degree in co-relation 21282. Up to 3563 conditions per place. [2025-03-13 21:59:18,189 INFO L140 encePairwiseOnDemand]: 379/385 looper letters, 69 selfloop transitions, 6 changer transitions 0/404 dead transitions. [2025-03-13 21:59:18,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 404 transitions, 1076 flow [2025-03-13 21:59:18,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:59:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:59:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2097 transitions. [2025-03-13 21:59:18,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9077922077922078 [2025-03-13 21:59:18,194 INFO L175 Difference]: Start difference. First operand has 350 places, 357 transitions, 752 flow. Second operand 6 states and 2097 transitions. [2025-03-13 21:59:18,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 404 transitions, 1076 flow [2025-03-13 21:59:18,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 404 transitions, 1074 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:59:18,206 INFO L231 Difference]: Finished difference. Result has 353 places, 356 transitions, 760 flow [2025-03-13 21:59:18,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=353, PETRI_TRANSITIONS=356} [2025-03-13 21:59:18,208 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -8 predicate places. [2025-03-13 21:59:18,208 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 356 transitions, 760 flow [2025-03-13 21:59:18,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.6666666666667) internal successors, (2032), 6 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:18,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:18,209 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:18,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:59:18,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 21:59:18,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash -753328619, now seen corresponding path program 1 times [2025-03-13 21:59:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506696240] [2025-03-13 21:59:18,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:18,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:18,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-13 21:59:18,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-13 21:59:18,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:18,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:18,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:18,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506696240] [2025-03-13 21:59:18,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506696240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:18,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:18,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:18,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29997125] [2025-03-13 21:59:18,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:18,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:18,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:18,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:18,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:18,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 385 [2025-03-13 21:59:18,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 356 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 344.6666666666667) internal successors, (1034), 3 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:18,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:18,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 385 [2025-03-13 21:59:18,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:21,611 INFO L124 PetriNetUnfolderBase]: 4077/20244 cut-off events. [2025-03-13 21:59:21,611 INFO L125 PetriNetUnfolderBase]: For 2322/2322 co-relation queries the response was YES. [2025-03-13 21:59:21,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25884 conditions, 20244 events. 4077/20244 cut-off events. For 2322/2322 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 257279 event pairs, 2550 based on Foata normal form. 120/17440 useless extension candidates. Maximal degree in co-relation 25777. Up to 3994 conditions per place. [2025-03-13 21:59:21,880 INFO L140 encePairwiseOnDemand]: 382/385 looper letters, 32 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-03-13 21:59:21,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 368 transitions, 867 flow [2025-03-13 21:59:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1061 transitions. [2025-03-13 21:59:21,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9186147186147187 [2025-03-13 21:59:21,882 INFO L175 Difference]: Start difference. First operand has 353 places, 356 transitions, 760 flow. Second operand 3 states and 1061 transitions. [2025-03-13 21:59:21,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 368 transitions, 867 flow [2025-03-13 21:59:21,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 368 transitions, 855 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:59:21,890 INFO L231 Difference]: Finished difference. Result has 351 places, 357 transitions, 760 flow [2025-03-13 21:59:21,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=351, PETRI_TRANSITIONS=357} [2025-03-13 21:59:21,893 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -10 predicate places. [2025-03-13 21:59:21,893 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 357 transitions, 760 flow [2025-03-13 21:59:21,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.6666666666667) internal successors, (1034), 3 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:21,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:21,894 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:21,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:59:21,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-13 21:59:21,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1429471024, now seen corresponding path program 1 times [2025-03-13 21:59:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096173601] [2025-03-13 21:59:21,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:21,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:21,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 21:59:21,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 21:59:21,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:21,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:21,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:59:21,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 21:59:21,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 21:59:21,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:21,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:59:21,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:59:21,930 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:59:21,930 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-03-13 21:59:21,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-03-13 21:59:21,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-03-13 21:59:21,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-03-13 21:59:21,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-03-13 21:59:21,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-03-13 21:59:21,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-03-13 21:59:21,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-03-13 21:59:21,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-03-13 21:59:21,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-03-13 21:59:21,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-03-13 21:59:21,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:59:21,932 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 21:59:21,932 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:59:21,933 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-13 21:59:21,980 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:59:21,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 426 places, 455 transitions, 964 flow [2025-03-13 21:59:22,032 INFO L124 PetriNetUnfolderBase]: 42/507 cut-off events. [2025-03-13 21:59:22,032 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-13 21:59:22,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 507 events. 42/507 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2189 event pairs, 0 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 447. Up to 7 conditions per place. [2025-03-13 21:59:22,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 426 places, 455 transitions, 964 flow [2025-03-13 21:59:22,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 426 places, 455 transitions, 964 flow [2025-03-13 21:59:22,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:59:22,049 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;@844c3b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:59:22,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-13 21:59:22,056 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:59:22,057 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2025-03-13 21:59:22,057 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-13 21:59:22,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:22,057 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] [2025-03-13 21:59:22,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-13 21:59:22,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:22,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1024452077, now seen corresponding path program 1 times [2025-03-13 21:59:22,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:22,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867817005] [2025-03-13 21:59:22,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:22,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-13 21:59:22,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-13 21:59:22,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:22,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:22,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:22,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867817005] [2025-03-13 21:59:22,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867817005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:22,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:22,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:59:22,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475863236] [2025-03-13 21:59:22,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:22,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:59:22,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:22,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:59:22,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:59:22,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 455 [2025-03-13 21:59:22,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 455 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:22,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:22,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 455 [2025-03-13 21:59:22,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:59:36,187 INFO L124 PetriNetUnfolderBase]: 15655/77153 cut-off events. [2025-03-13 21:59:36,187 INFO L125 PetriNetUnfolderBase]: For 29281/29281 co-relation queries the response was YES. [2025-03-13 21:59:37,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100844 conditions, 77153 events. 15655/77153 cut-off events. For 29281/29281 co-relation queries the response was YES. Maximal size of possible extension queue 1629. Compared 1191586 event pairs, 10572 based on Foata normal form. 19647/85997 useless extension candidates. Maximal degree in co-relation 30120. Up to 14213 conditions per place. [2025-03-13 21:59:38,416 INFO L140 encePairwiseOnDemand]: 433/455 looper letters, 39 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2025-03-13 21:59:38,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 437 transitions, 1055 flow [2025-03-13 21:59:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:59:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:59:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2025-03-13 21:59:38,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.947985347985348 [2025-03-13 21:59:38,419 INFO L175 Difference]: Start difference. First operand has 426 places, 455 transitions, 964 flow. Second operand 3 states and 1294 transitions. [2025-03-13 21:59:38,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 437 transitions, 1055 flow [2025-03-13 21:59:38,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 437 transitions, 1015 flow, removed 20 selfloop flow, removed 0 redundant places. [2025-03-13 21:59:38,435 INFO L231 Difference]: Finished difference. Result has 413 places, 422 transitions, 888 flow [2025-03-13 21:59:38,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=413, PETRI_TRANSITIONS=422} [2025-03-13 21:59:38,436 INFO L279 CegarLoopForPetriNet]: 426 programPoint places, -13 predicate places. [2025-03-13 21:59:38,436 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 422 transitions, 888 flow [2025-03-13 21:59:38,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:38,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:59:38,437 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:59:38,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:59:38,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-13 21:59:38,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:59:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1867962731, now seen corresponding path program 1 times [2025-03-13 21:59:38,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:59:38,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824100557] [2025-03-13 21:59:38,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:59:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:59:38,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 21:59:38,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 21:59:38,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:59:38,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:59:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:59:38,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:59:38,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824100557] [2025-03-13 21:59:38,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824100557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:59:38,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:59:38,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:59:38,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264001629] [2025-03-13 21:59:38,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:59:38,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:59:38,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:59:38,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:59:38,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:59:38,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 455 [2025-03-13 21:59:38,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 422 transitions, 888 flow. Second operand has 6 states, 6 states have (on average 401.6666666666667) internal successors, (2410), 6 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:59:38,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:59:38,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 455 [2025-03-13 21:59:38,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand