./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c885fc256284ed3b5456c69b30daa307e14001acfa6c144983451f9519cbd1fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:58:50,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:58:50,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 08:58:50,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:58:50,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:58:50,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:58:50,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:58:50,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:58:50,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:58:50,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:58:50,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:58:50,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:58:50,603 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:58:50,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:58:50,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:58:50,603 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:58:50,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:58:50,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:58:50,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:58:50,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:58:50,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:58:50,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:58:50,604 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 08:58:50,604 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 08:58:50,604 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:58:50,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:58:50,604 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:58:50,604 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:58:50,604 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:58:50,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:58:50,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:58:50,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:58:50,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:58:50,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:58:50,605 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:58:50,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:58:50,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:58:50,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:58:50,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:58:50,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:58:50,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:58:50,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:58:50,605 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c885fc256284ed3b5456c69b30daa307e14001acfa6c144983451f9519cbd1fd [2025-02-06 08:58:50,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:58:50,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:58:50,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:58:50,923 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:58:50,924 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:58:50,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i [2025-02-06 08:58:52,426 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/525df9d37/c9d1f9b9061f41e0842535c8d028f630/FLAG2b7fff1c8 [2025-02-06 08:58:52,839 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:58:52,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i [2025-02-06 08:58:52,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/525df9d37/c9d1f9b9061f41e0842535c8d028f630/FLAG2b7fff1c8 [2025-02-06 08:58:52,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/525df9d37/c9d1f9b9061f41e0842535c8d028f630 [2025-02-06 08:58:52,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:58:52,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:58:52,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:58:52,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:58:52,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:58:52,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:58:52" (1/1) ... [2025-02-06 08:58:52,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b68d755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:52, skipping insertion in model container [2025-02-06 08:58:52,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:58:52" (1/1) ... [2025-02-06 08:58:52,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:58:53,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:58:53,198 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:58:53,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:58:53,274 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:58:53,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53 WrapperNode [2025-02-06 08:58:53,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:58:53,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:58:53,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:58:53,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:58:53,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53" (1/1) ... [2025-02-06 08:58:53,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53" (1/1) ... [2025-02-06 08:58:53,312 INFO L138 Inliner]: procedures = 164, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 102 [2025-02-06 08:58:53,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:58:53,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:58:53,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:58:53,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:58:53,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53" (1/1) ... [2025-02-06 08:58:53,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53" (1/1) ... [2025-02-06 08:58:53,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53" (1/1) ... [2025-02-06 08:58:53,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53" (1/1) ... [2025-02-06 08:58:53,330 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53" (1/1) ... [2025-02-06 08:58:53,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53" (1/1) ... [2025-02-06 08:58:53,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53" (1/1) ... [2025-02-06 08:58:53,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53" (1/1) ... [2025-02-06 08:58:53,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:58:53,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:58:53,341 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:58:53,341 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:58:53,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53" (1/1) ... [2025-02-06 08:58:53,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:58:53,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:53,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:58:53,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:58:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 08:58:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 08:58:53,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 08:58:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 08:58:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 08:58:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:58:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 08:58:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 08:58:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:58:53,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:58:53,410 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 08:58:53,517 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:58:53,519 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:58:53,761 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 08:58:53,761 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:58:53,783 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:58:53,784 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 08:58:53,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:58:53 BoogieIcfgContainer [2025-02-06 08:58:53,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:58:53,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:58:53,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:58:53,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:58:53,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:58:52" (1/3) ... [2025-02-06 08:58:53,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa42e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:58:53, skipping insertion in model container [2025-02-06 08:58:53,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:53" (2/3) ... [2025-02-06 08:58:53,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa42e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:58:53, skipping insertion in model container [2025-02-06 08:58:53,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:58:53" (3/3) ... [2025-02-06 08:58:53,794 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-race.i [2025-02-06 08:58:53,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:58:53,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-race.i that has 2 procedures, 114 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-02-06 08:58:53,810 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 08:58:53,876 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:58:53,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 122 transitions, 248 flow [2025-02-06 08:58:53,959 INFO L124 PetriNetUnfolderBase]: 8/129 cut-off events. [2025-02-06 08:58:53,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:58:53,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 129 events. 8/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 194 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-02-06 08:58:53,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 122 transitions, 248 flow [2025-02-06 08:58:53,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 122 transitions, 248 flow [2025-02-06 08:58:53,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:58:53,988 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;@452158ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:58:53,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 08:58:54,007 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:58:54,008 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-06 08:58:54,008 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:58:54,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:54,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:54,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 08:58:54,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash 242270650, now seen corresponding path program 1 times [2025-02-06 08:58:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:54,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481501291] [2025-02-06 08:58:54,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:54,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 08:58:54,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 08:58:54,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:54,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:54,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481501291] [2025-02-06 08:58:54,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481501291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:54,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:54,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:58:54,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524708232] [2025-02-06 08:58:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:54,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:58:54,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:54,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:58:54,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:58:54,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2025-02-06 08:58:54,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:54,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:54,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2025-02-06 08:58:54,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:55,036 INFO L124 PetriNetUnfolderBase]: 5/115 cut-off events. [2025-02-06 08:58:55,036 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 08:58:55,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 115 events. 5/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 133 event pairs, 0 based on Foata normal form. 11/115 useless extension candidates. Maximal degree in co-relation 75. Up to 14 conditions per place. [2025-02-06 08:58:55,038 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 13 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2025-02-06 08:58:55,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 112 transitions, 264 flow [2025-02-06 08:58:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:58:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:58:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2025-02-06 08:58:55,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8265027322404371 [2025-02-06 08:58:55,055 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 248 flow. Second operand 6 states and 605 transitions. [2025-02-06 08:58:55,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 112 transitions, 264 flow [2025-02-06 08:58:55,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:55,065 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 238 flow [2025-02-06 08:58:55,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-02-06 08:58:55,071 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-02-06 08:58:55,072 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 238 flow [2025-02-06 08:58:55,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:55,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:55,073 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] [2025-02-06 08:58:55,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:58:55,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 08:58:55,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:55,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1896431640, now seen corresponding path program 1 times [2025-02-06 08:58:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:55,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131452516] [2025-02-06 08:58:55,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:55,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:55,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 08:58:55,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 08:58:55,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:55,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:55,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:55,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131452516] [2025-02-06 08:58:55,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131452516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:55,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:55,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:58:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689675678] [2025-02-06 08:58:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:55,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:58:55,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:55,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:58:55,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:58:55,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 122 [2025-02-06 08:58:55,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:55,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:55,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 122 [2025-02-06 08:58:55,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:55,212 INFO L124 PetriNetUnfolderBase]: 5/127 cut-off events. [2025-02-06 08:58:55,212 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 08:58:55,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 127 events. 5/127 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 130 event pairs, 0 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 90. Up to 9 conditions per place. [2025-02-06 08:58:55,213 INFO L140 encePairwiseOnDemand]: 119/122 looper letters, 7 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-02-06 08:58:55,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 260 flow [2025-02-06 08:58:55,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:58:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:58:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2025-02-06 08:58:55,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912568306010929 [2025-02-06 08:58:55,215 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 238 flow. Second operand 3 states and 334 transitions. [2025-02-06 08:58:55,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 260 flow [2025-02-06 08:58:55,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 248 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:58:55,221 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 240 flow [2025-02-06 08:58:55,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2025-02-06 08:58:55,222 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2025-02-06 08:58:55,222 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 240 flow [2025-02-06 08:58:55,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:55,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:55,222 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] [2025-02-06 08:58:55,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:58:55,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 08:58:55,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:55,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1800088938, now seen corresponding path program 1 times [2025-02-06 08:58:55,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:55,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018656730] [2025-02-06 08:58:55,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:55,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:55,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 08:58:55,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 08:58:55,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:55,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:55,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:55,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018656730] [2025-02-06 08:58:55,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018656730] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:58:55,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728285916] [2025-02-06 08:58:55,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:55,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:55,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:55,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:58:55,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:58:55,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 08:58:55,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 08:58:55,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:55,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:55,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 08:58:55,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:58:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:55,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:58:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:55,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728285916] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:58:55,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:58:55,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 08:58:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235800509] [2025-02-06 08:58:55,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:58:55,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:58:55,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:55,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:58:55,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:58:55,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 122 [2025-02-06 08:58:55,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 240 flow. Second operand has 10 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:55,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:55,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 122 [2025-02-06 08:58:55,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:55,630 INFO L124 PetriNetUnfolderBase]: 5/142 cut-off events. [2025-02-06 08:58:55,630 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 08:58:55,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 142 events. 5/142 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 125. Up to 9 conditions per place. [2025-02-06 08:58:55,634 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 11 selfloop transitions, 9 changer transitions 0/121 dead transitions. [2025-02-06 08:58:55,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 121 transitions, 298 flow [2025-02-06 08:58:55,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:58:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 08:58:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 967 transitions. [2025-02-06 08:58:55,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8806921675774135 [2025-02-06 08:58:55,636 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 240 flow. Second operand 9 states and 967 transitions. [2025-02-06 08:58:55,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 121 transitions, 298 flow [2025-02-06 08:58:55,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 121 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:58:55,638 INFO L231 Difference]: Finished difference. Result has 123 places, 119 transitions, 288 flow [2025-02-06 08:58:55,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=288, PETRI_PLACES=123, PETRI_TRANSITIONS=119} [2025-02-06 08:58:55,639 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-02-06 08:58:55,639 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 288 flow [2025-02-06 08:58:55,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:55,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:55,640 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 08:58:55,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:58:55,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:55,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 08:58:55,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:55,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1402008106, now seen corresponding path program 2 times [2025-02-06 08:58:55,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:55,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394927430] [2025-02-06 08:58:55,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:58:55,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:55,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-06 08:58:55,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 08:58:55,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:58:55,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:56,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:56,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394927430] [2025-02-06 08:58:56,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394927430] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:58:56,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192527592] [2025-02-06 08:58:56,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:58:56,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:56,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:56,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:58:56,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:58:56,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-06 08:58:56,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 08:58:56,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:58:56,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:56,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 08:58:56,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:58:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:56,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:58:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:56,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192527592] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:58:56,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:58:56,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-06 08:58:56,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120777190] [2025-02-06 08:58:56,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:58:56,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 08:58:56,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:56,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 08:58:56,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:58:56,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 122 [2025-02-06 08:58:56,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 119 transitions, 288 flow. Second operand has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:56,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:56,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 122 [2025-02-06 08:58:56,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:56,653 INFO L124 PetriNetUnfolderBase]: 5/181 cut-off events. [2025-02-06 08:58:56,653 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-06 08:58:56,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 181 events. 5/181 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 103 event pairs, 0 based on Foata normal form. 3/174 useless extension candidates. Maximal degree in co-relation 185. Up to 9 conditions per place. [2025-02-06 08:58:56,657 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 14 selfloop transitions, 18 changer transitions 0/133 dead transitions. [2025-02-06 08:58:56,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 426 flow [2025-02-06 08:58:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 08:58:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 08:58:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1925 transitions. [2025-02-06 08:58:56,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8765938069216758 [2025-02-06 08:58:56,662 INFO L175 Difference]: Start difference. First operand has 123 places, 119 transitions, 288 flow. Second operand 18 states and 1925 transitions. [2025-02-06 08:58:56,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 426 flow [2025-02-06 08:58:56,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 133 transitions, 414 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 08:58:56,666 INFO L231 Difference]: Finished difference. Result has 143 places, 129 transitions, 388 flow [2025-02-06 08:58:56,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=388, PETRI_PLACES=143, PETRI_TRANSITIONS=129} [2025-02-06 08:58:56,668 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2025-02-06 08:58:56,669 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 129 transitions, 388 flow [2025-02-06 08:58:56,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:56,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:56,670 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2025-02-06 08:58:56,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 08:58:56,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:56,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 08:58:56,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:56,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1148885416, now seen corresponding path program 3 times [2025-02-06 08:58:56,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:56,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165493776] [2025-02-06 08:58:56,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 08:58:56,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:56,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 7 equivalence classes. [2025-02-06 08:58:56,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 08:58:56,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 08:58:56,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:56,981 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:58:56,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 08:58:57,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 08:58:57,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:57,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:57,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:58:57,037 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:58:57,038 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-06 08:58:57,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-06 08:58:57,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-06 08:58:57,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-06 08:58:57,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-06 08:58:57,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-06 08:58:57,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-06 08:58:57,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-06 08:58:57,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-06 08:58:57,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-06 08:58:57,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:58:57,041 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-02-06 08:58:57,043 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:58:57,043 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 08:58:57,083 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:58:57,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 192 transitions, 394 flow [2025-02-06 08:58:57,118 INFO L124 PetriNetUnfolderBase]: 15/208 cut-off events. [2025-02-06 08:58:57,118 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 08:58:57,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 208 events. 15/208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 526 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 147. Up to 3 conditions per place. [2025-02-06 08:58:57,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 192 transitions, 394 flow [2025-02-06 08:58:57,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 192 transitions, 394 flow [2025-02-06 08:58:57,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:58:57,122 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;@452158ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:58:57,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-06 08:58:57,127 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:58:57,128 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-06 08:58:57,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:58:57,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:57,129 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] [2025-02-06 08:58:57,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 08:58:57,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1557277306, now seen corresponding path program 1 times [2025-02-06 08:58:57,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:57,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331039728] [2025-02-06 08:58:57,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:57,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:57,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 08:58:57,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 08:58:57,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:57,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:57,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:57,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331039728] [2025-02-06 08:58:57,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331039728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:57,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:57,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:58:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525001671] [2025-02-06 08:58:57,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:57,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:58:57,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:57,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:58:57,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:58:57,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 192 [2025-02-06 08:58:57,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 192 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:57,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:57,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 192 [2025-02-06 08:58:57,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:57,610 INFO L124 PetriNetUnfolderBase]: 90/600 cut-off events. [2025-02-06 08:58:57,610 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 08:58:57,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 600 events. 90/600 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3394 event pairs, 42 based on Foata normal form. 91/595 useless extension candidates. Maximal degree in co-relation 312. Up to 125 conditions per place. [2025-02-06 08:58:57,618 INFO L140 encePairwiseOnDemand]: 179/192 looper letters, 20 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2025-02-06 08:58:57,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 177 transitions, 414 flow [2025-02-06 08:58:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:58:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:58:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 969 transitions. [2025-02-06 08:58:57,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8411458333333334 [2025-02-06 08:58:57,621 INFO L175 Difference]: Start difference. First operand has 182 places, 192 transitions, 394 flow. Second operand 6 states and 969 transitions. [2025-02-06 08:58:57,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 177 transitions, 414 flow [2025-02-06 08:58:57,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 177 transitions, 414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:57,625 INFO L231 Difference]: Finished difference. Result has 178 places, 177 transitions, 374 flow [2025-02-06 08:58:57,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=178, PETRI_TRANSITIONS=177} [2025-02-06 08:58:57,626 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -4 predicate places. [2025-02-06 08:58:57,626 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 177 transitions, 374 flow [2025-02-06 08:58:57,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:57,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:57,626 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, 1, 1, 1] [2025-02-06 08:58:57,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:58:57,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 08:58:57,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:57,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1159655658, now seen corresponding path program 1 times [2025-02-06 08:58:57,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:57,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611553219] [2025-02-06 08:58:57,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:57,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:57,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 08:58:57,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 08:58:57,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:57,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:57,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:57,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611553219] [2025-02-06 08:58:57,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611553219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:57,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:57,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:58:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824709299] [2025-02-06 08:58:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:57,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:58:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:57,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:58:57,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:58:57,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 192 [2025-02-06 08:58:57,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 177 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:57,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:57,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 192 [2025-02-06 08:58:57,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:57,713 INFO L124 PetriNetUnfolderBase]: 23/345 cut-off events. [2025-02-06 08:58:57,713 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 08:58:57,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 345 events. 23/345 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1168 event pairs, 6 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 332. Up to 24 conditions per place. [2025-02-06 08:58:57,715 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 10 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2025-02-06 08:58:57,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 178 transitions, 402 flow [2025-02-06 08:58:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:58:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:58:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-02-06 08:58:57,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9131944444444444 [2025-02-06 08:58:57,717 INFO L175 Difference]: Start difference. First operand has 178 places, 177 transitions, 374 flow. Second operand 3 states and 526 transitions. [2025-02-06 08:58:57,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 178 transitions, 402 flow [2025-02-06 08:58:57,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 178 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:58:57,719 INFO L231 Difference]: Finished difference. Result has 176 places, 178 transitions, 376 flow [2025-02-06 08:58:57,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=176, PETRI_TRANSITIONS=178} [2025-02-06 08:58:57,720 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -6 predicate places. [2025-02-06 08:58:57,720 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 178 transitions, 376 flow [2025-02-06 08:58:57,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:57,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:57,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:57,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:58:57,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 08:58:57,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:57,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2058549844, now seen corresponding path program 1 times [2025-02-06 08:58:57,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:57,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819280627] [2025-02-06 08:58:57,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:57,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:57,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 08:58:57,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 08:58:57,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:57,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:57,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:57,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819280627] [2025-02-06 08:58:57,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819280627] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:58:57,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096358306] [2025-02-06 08:58:57,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:57,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:57,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:57,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:58:57,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 08:58:57,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 08:58:57,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 08:58:57,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:57,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:57,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 08:58:57,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:58:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:57,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:58:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:57,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096358306] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:58:57,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:58:57,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 08:58:57,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742996378] [2025-02-06 08:58:57,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:58:57,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:58:57,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:57,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:58:57,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:58:57,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2025-02-06 08:58:57,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 178 transitions, 376 flow. Second operand has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:57,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:57,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2025-02-06 08:58:57,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:58,059 INFO L124 PetriNetUnfolderBase]: 23/360 cut-off events. [2025-02-06 08:58:58,059 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 08:58:58,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 360 events. 23/360 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1137 event pairs, 6 based on Foata normal form. 2/321 useless extension candidates. Maximal degree in co-relation 367. Up to 24 conditions per place. [2025-02-06 08:58:58,061 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 14 selfloop transitions, 9 changer transitions 0/186 dead transitions. [2025-02-06 08:58:58,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 186 transitions, 440 flow [2025-02-06 08:58:58,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:58:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 08:58:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1537 transitions. [2025-02-06 08:58:58,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8894675925925926 [2025-02-06 08:58:58,064 INFO L175 Difference]: Start difference. First operand has 176 places, 178 transitions, 376 flow. Second operand 9 states and 1537 transitions. [2025-02-06 08:58:58,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 186 transitions, 440 flow [2025-02-06 08:58:58,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 186 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:58:58,066 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 424 flow [2025-02-06 08:58:58,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=424, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2025-02-06 08:58:58,067 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-02-06 08:58:58,067 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 424 flow [2025-02-06 08:58:58,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:58,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:58,068 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2025-02-06 08:58:58,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 08:58:58,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:58,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 08:58:58,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash 85852780, now seen corresponding path program 2 times [2025-02-06 08:58:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957633029] [2025-02-06 08:58:58,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:58:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:58,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-06 08:58:58,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 08:58:58,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:58:58,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 08:58:58,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:58,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957633029] [2025-02-06 08:58:58,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957633029] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:58:58,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901854784] [2025-02-06 08:58:58,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:58:58,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:58,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:58,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:58:58,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 08:58:58,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-06 08:58:58,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 08:58:58,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:58:58,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:58,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 08:58:58,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:58:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 08:58:58,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:58:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 08:58:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901854784] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:58:58,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:58:58,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-06 08:58:58,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497165139] [2025-02-06 08:58:58,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:58:58,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 08:58:58,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:58,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 08:58:58,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:58:58,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2025-02-06 08:58:58,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 424 flow. Second operand has 15 states, 15 states have (on average 170.13333333333333) internal successors, (2552), 15 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:58,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:58,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2025-02-06 08:58:58,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:58,963 INFO L124 PetriNetUnfolderBase]: 23/399 cut-off events. [2025-02-06 08:58:58,965 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-06 08:58:58,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 399 events. 23/399 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1139 event pairs, 6 based on Foata normal form. 3/361 useless extension candidates. Maximal degree in co-relation 329. Up to 24 conditions per place. [2025-02-06 08:58:58,968 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 17 selfloop transitions, 18 changer transitions 0/198 dead transitions. [2025-02-06 08:58:58,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 198 transitions, 568 flow [2025-02-06 08:58:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 08:58:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 08:58:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3062 transitions. [2025-02-06 08:58:58,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8859953703703703 [2025-02-06 08:58:58,973 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 424 flow. Second operand 18 states and 3062 transitions. [2025-02-06 08:58:58,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 198 transitions, 568 flow [2025-02-06 08:58:58,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 198 transitions, 556 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 08:58:58,979 INFO L231 Difference]: Finished difference. Result has 206 places, 194 transitions, 524 flow [2025-02-06 08:58:58,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=524, PETRI_PLACES=206, PETRI_TRANSITIONS=194} [2025-02-06 08:58:58,980 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 24 predicate places. [2025-02-06 08:58:58,981 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 194 transitions, 524 flow [2025-02-06 08:58:58,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 170.13333333333333) internal successors, (2552), 15 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:58,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:58,983 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1] [2025-02-06 08:58:58,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 08:58:59,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 08:58:59,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 08:58:59,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1905122646, now seen corresponding path program 3 times [2025-02-06 08:58:59,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:59,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971660819] [2025-02-06 08:58:59,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 08:58:59,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:59,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-02-06 08:58:59,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 08:58:59,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-06 08:58:59,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:59,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:58:59,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 08:58:59,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 08:58:59,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:59,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:59,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:58:59,286 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:58:59,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-02-06 08:58:59,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-02-06 08:58:59,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:58:59,288 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-02-06 08:58:59,288 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:58:59,288 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 08:58:59,321 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:58:59,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 262 transitions, 542 flow [2025-02-06 08:58:59,346 INFO L124 PetriNetUnfolderBase]: 22/287 cut-off events. [2025-02-06 08:58:59,346 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 08:58:59,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 287 events. 22/287 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 916 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 216. Up to 4 conditions per place. [2025-02-06 08:58:59,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 262 transitions, 542 flow [2025-02-06 08:58:59,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 262 transitions, 542 flow [2025-02-06 08:58:59,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:58:59,352 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;@452158ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:58:59,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-06 08:58:59,355 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:58:59,355 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-06 08:58:59,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:58:59,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:59,355 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] [2025-02-06 08:58:59,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 08:58:59,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:59,356 INFO L85 PathProgramCache]: Analyzing trace with hash 264705728, now seen corresponding path program 1 times [2025-02-06 08:58:59,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:59,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199485876] [2025-02-06 08:58:59,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:59,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:59,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 08:58:59,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 08:58:59,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:59,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199485876] [2025-02-06 08:58:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199485876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:59,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:59,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:58:59,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304111030] [2025-02-06 08:58:59,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:59,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:58:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:59,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:58:59,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:58:59,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 262 [2025-02-06 08:58:59,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 262 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:59,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:59,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 262 [2025-02-06 08:58:59,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:00,107 INFO L124 PetriNetUnfolderBase]: 1081/4122 cut-off events. [2025-02-06 08:59:00,107 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-02-06 08:59:00,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 4122 events. 1081/4122 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 38989 event pairs, 630 based on Foata normal form. 720/4055 useless extension candidates. Maximal degree in co-relation 1470. Up to 1318 conditions per place. [2025-02-06 08:59:00,143 INFO L140 encePairwiseOnDemand]: 246/262 looper letters, 27 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2025-02-06 08:59:00,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 242 transitions, 566 flow [2025-02-06 08:59:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:59:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:59:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1333 transitions. [2025-02-06 08:59:00,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479643765903307 [2025-02-06 08:59:00,146 INFO L175 Difference]: Start difference. First operand has 247 places, 262 transitions, 542 flow. Second operand 6 states and 1333 transitions. [2025-02-06 08:59:00,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 242 transitions, 566 flow [2025-02-06 08:59:00,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 242 transitions, 564 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 08:59:00,150 INFO L231 Difference]: Finished difference. Result has 241 places, 242 transitions, 510 flow [2025-02-06 08:59:00,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=241, PETRI_TRANSITIONS=242} [2025-02-06 08:59:00,151 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -6 predicate places. [2025-02-06 08:59:00,151 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 242 transitions, 510 flow [2025-02-06 08:59:00,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:00,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:00,152 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, 1, 1, 1] [2025-02-06 08:59:00,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:59:00,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 08:59:00,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:00,152 INFO L85 PathProgramCache]: Analyzing trace with hash -481126473, now seen corresponding path program 1 times [2025-02-06 08:59:00,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:00,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911775468] [2025-02-06 08:59:00,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:00,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 08:59:00,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 08:59:00,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:00,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:00,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:00,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911775468] [2025-02-06 08:59:00,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911775468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:59:00,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:59:00,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:59:00,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069307579] [2025-02-06 08:59:00,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:59:00,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:59:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:00,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:59:00,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:59:00,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 262 [2025-02-06 08:59:00,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 242 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:00,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:00,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 262 [2025-02-06 08:59:00,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:00,343 INFO L124 PetriNetUnfolderBase]: 95/1017 cut-off events. [2025-02-06 08:59:00,343 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-06 08:59:00,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 1017 events. 95/1017 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6163 event pairs, 42 based on Foata normal form. 1/883 useless extension candidates. Maximal degree in co-relation 1094. Up to 87 conditions per place. [2025-02-06 08:59:00,351 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 13 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2025-02-06 08:59:00,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 243 transitions, 544 flow [2025-02-06 08:59:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:59:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:59:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-02-06 08:59:00,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134860050890585 [2025-02-06 08:59:00,353 INFO L175 Difference]: Start difference. First operand has 241 places, 242 transitions, 510 flow. Second operand 3 states and 718 transitions. [2025-02-06 08:59:00,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 243 transitions, 544 flow [2025-02-06 08:59:00,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 243 transitions, 532 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:59:00,356 INFO L231 Difference]: Finished difference. Result has 239 places, 243 transitions, 512 flow [2025-02-06 08:59:00,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=239, PETRI_TRANSITIONS=243} [2025-02-06 08:59:00,358 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -8 predicate places. [2025-02-06 08:59:00,358 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 243 transitions, 512 flow [2025-02-06 08:59:00,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:00,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:00,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:59:00,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:59:00,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 08:59:00,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:00,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2005451263, now seen corresponding path program 1 times [2025-02-06 08:59:00,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:00,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683815390] [2025-02-06 08:59:00,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:00,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 08:59:00,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 08:59:00,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:00,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:00,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:00,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:00,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683815390] [2025-02-06 08:59:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683815390] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:59:00,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082370425] [2025-02-06 08:59:00,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:00,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:59:00,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:59:00,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:59:00,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 08:59:00,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 08:59:00,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 08:59:00,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:00,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:00,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 08:59:00,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:59:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:00,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:59:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:00,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082370425] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:59:00,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:59:00,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 08:59:00,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345842512] [2025-02-06 08:59:00,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:59:00,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:59:00,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:00,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:59:00,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:59:00,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2025-02-06 08:59:00,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 243 transitions, 512 flow. Second operand has 10 states, 10 states have (on average 233.1) internal successors, (2331), 10 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:00,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:00,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2025-02-06 08:59:00,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:00,727 INFO L124 PetriNetUnfolderBase]: 95/1032 cut-off events. [2025-02-06 08:59:00,727 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-06 08:59:00,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 1032 events. 95/1032 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6134 event pairs, 42 based on Foata normal form. 2/899 useless extension candidates. Maximal degree in co-relation 1129. Up to 87 conditions per place. [2025-02-06 08:59:00,738 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 17 selfloop transitions, 9 changer transitions 0/251 dead transitions. [2025-02-06 08:59:00,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 251 transitions, 582 flow [2025-02-06 08:59:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:59:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 08:59:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2107 transitions. [2025-02-06 08:59:00,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8935538592027141 [2025-02-06 08:59:00,742 INFO L175 Difference]: Start difference. First operand has 239 places, 243 transitions, 512 flow. Second operand 9 states and 2107 transitions. [2025-02-06 08:59:00,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 251 transitions, 582 flow [2025-02-06 08:59:00,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 251 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:59:00,745 INFO L231 Difference]: Finished difference. Result has 249 places, 249 transitions, 560 flow [2025-02-06 08:59:00,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=560, PETRI_PLACES=249, PETRI_TRANSITIONS=249} [2025-02-06 08:59:00,747 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-02-06 08:59:00,747 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 249 transitions, 560 flow [2025-02-06 08:59:00,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 233.1) internal successors, (2331), 10 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:00,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:00,748 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2025-02-06 08:59:00,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 08:59:00,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 08:59:00,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 08:59:00,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:00,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1556737279, now seen corresponding path program 2 times [2025-02-06 08:59:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:00,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665149303] [2025-02-06 08:59:00,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:59:00,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:00,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-02-06 08:59:00,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:59:00,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:59:00,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:01,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:01,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665149303] [2025-02-06 08:59:01,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665149303] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:59:01,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054909360] [2025-02-06 08:59:01,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:59:01,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:59:01,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:59:01,073 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:59:01,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 08:59:01,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-02-06 08:59:01,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:59:01,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:59:01,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:01,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 08:59:01,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:59:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:01,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:59:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:01,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054909360] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:59:01,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:59:01,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-06 08:59:01,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458986519] [2025-02-06 08:59:01,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:59:01,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 08:59:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:01,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 08:59:01,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:59:01,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2025-02-06 08:59:01,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 249 transitions, 560 flow. Second operand has 15 states, 15 states have (on average 233.2) internal successors, (3498), 15 states have internal predecessors, (3498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:01,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:01,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2025-02-06 08:59:01,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:01,652 INFO L124 PetriNetUnfolderBase]: 95/1071 cut-off events. [2025-02-06 08:59:01,652 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-02-06 08:59:01,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 1071 events. 95/1071 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6167 event pairs, 42 based on Foata normal form. 3/939 useless extension candidates. Maximal degree in co-relation 1091. Up to 87 conditions per place. [2025-02-06 08:59:01,663 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 20 selfloop transitions, 18 changer transitions 0/263 dead transitions. [2025-02-06 08:59:01,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 710 flow [2025-02-06 08:59:01,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 08:59:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 08:59:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4199 transitions. [2025-02-06 08:59:01,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.890373197625106 [2025-02-06 08:59:01,671 INFO L175 Difference]: Start difference. First operand has 249 places, 249 transitions, 560 flow. Second operand 18 states and 4199 transitions. [2025-02-06 08:59:01,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 263 transitions, 710 flow [2025-02-06 08:59:01,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 263 transitions, 698 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 08:59:01,676 INFO L231 Difference]: Finished difference. Result has 269 places, 259 transitions, 660 flow [2025-02-06 08:59:01,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=660, PETRI_PLACES=269, PETRI_TRANSITIONS=259} [2025-02-06 08:59:01,677 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 22 predicate places. [2025-02-06 08:59:01,678 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 259 transitions, 660 flow [2025-02-06 08:59:01,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 233.2) internal successors, (3498), 15 states have internal predecessors, (3498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:01,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:01,680 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1] [2025-02-06 08:59:01,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 08:59:01,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 08:59:01,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 08:59:01,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash 752400055, now seen corresponding path program 3 times [2025-02-06 08:59:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:01,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373891893] [2025-02-06 08:59:01,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 08:59:01,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:01,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 7 equivalence classes. [2025-02-06 08:59:01,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 08:59:01,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 08:59:01,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:59:01,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:59:01,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 08:59:01,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 08:59:01,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:01,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:59:01,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:59:01,975 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:59:01,975 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-02-06 08:59:01,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-02-06 08:59:01,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-02-06 08:59:01,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-02-06 08:59:01,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-02-06 08:59:01,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:59:01,977 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-02-06 08:59:01,977 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:59:01,977 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 08:59:02,034 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:59:02,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 332 transitions, 692 flow [2025-02-06 08:59:02,087 INFO L124 PetriNetUnfolderBase]: 29/366 cut-off events. [2025-02-06 08:59:02,087 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 08:59:02,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 366 events. 29/366 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1328 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 295. Up to 5 conditions per place. [2025-02-06 08:59:02,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 332 transitions, 692 flow [2025-02-06 08:59:02,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 332 transitions, 692 flow [2025-02-06 08:59:02,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:59:02,102 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;@452158ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:59:02,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-06 08:59:02,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:59:02,106 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-06 08:59:02,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:59:02,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:02,106 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] [2025-02-06 08:59:02,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:59:02,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:02,107 INFO L85 PathProgramCache]: Analyzing trace with hash 659523212, now seen corresponding path program 1 times [2025-02-06 08:59:02,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:02,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891535555] [2025-02-06 08:59:02,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:02,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:02,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 08:59:02,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 08:59:02,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:02,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:02,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891535555] [2025-02-06 08:59:02,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891535555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:59:02,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:59:02,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:59:02,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006208314] [2025-02-06 08:59:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:59:02,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:59:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:02,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:59:02,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:59:02,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 332 [2025-02-06 08:59:02,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 332 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:02,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:02,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 332 [2025-02-06 08:59:02,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:06,453 INFO L124 PetriNetUnfolderBase]: 10778/30460 cut-off events. [2025-02-06 08:59:06,454 INFO L125 PetriNetUnfolderBase]: For 4130/4130 co-relation queries the response was YES. [2025-02-06 08:59:06,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44913 conditions, 30460 events. 10778/30460 cut-off events. For 4130/4130 co-relation queries the response was YES. Maximal size of possible extension queue 1434. Compared 371221 event pairs, 6804 based on Foata normal form. 6397/30591 useless extension candidates. Maximal degree in co-relation 6942. Up to 12509 conditions per place. [2025-02-06 08:59:06,880 INFO L140 encePairwiseOnDemand]: 313/332 looper letters, 34 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2025-02-06 08:59:06,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 307 transitions, 720 flow [2025-02-06 08:59:06,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:59:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:59:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1697 transitions. [2025-02-06 08:59:06,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8519076305220884 [2025-02-06 08:59:06,884 INFO L175 Difference]: Start difference. First operand has 312 places, 332 transitions, 692 flow. Second operand 6 states and 1697 transitions. [2025-02-06 08:59:06,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 307 transitions, 720 flow [2025-02-06 08:59:06,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 307 transitions, 714 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 08:59:06,890 INFO L231 Difference]: Finished difference. Result has 304 places, 307 transitions, 646 flow [2025-02-06 08:59:06,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=646, PETRI_PLACES=304, PETRI_TRANSITIONS=307} [2025-02-06 08:59:06,891 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-02-06 08:59:06,891 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 646 flow [2025-02-06 08:59:06,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:06,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:06,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:59:06,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:59:06,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:59:06,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:06,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2020750175, now seen corresponding path program 1 times [2025-02-06 08:59:06,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:06,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036474722] [2025-02-06 08:59:06,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:06,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 08:59:06,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 08:59:06,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:06,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:06,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:06,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036474722] [2025-02-06 08:59:06,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036474722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:59:06,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:59:06,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:59:06,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470209674] [2025-02-06 08:59:06,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:59:06,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:59:06,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:06,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:59:06,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:59:06,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 332 [2025-02-06 08:59:06,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:06,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:06,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 332 [2025-02-06 08:59:06,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:07,396 INFO L124 PetriNetUnfolderBase]: 365/3087 cut-off events. [2025-02-06 08:59:07,396 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-02-06 08:59:07,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 3087 events. 365/3087 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 26986 event pairs, 204 based on Foata normal form. 1/2670 useless extension candidates. Maximal degree in co-relation 3488. Up to 330 conditions per place. [2025-02-06 08:59:07,431 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 16 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-02-06 08:59:07,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 308 transitions, 686 flow [2025-02-06 08:59:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:59:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:59:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2025-02-06 08:59:07,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9136546184738956 [2025-02-06 08:59:07,433 INFO L175 Difference]: Start difference. First operand has 304 places, 307 transitions, 646 flow. Second operand 3 states and 910 transitions. [2025-02-06 08:59:07,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 308 transitions, 686 flow [2025-02-06 08:59:07,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 308 transitions, 674 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:59:07,437 INFO L231 Difference]: Finished difference. Result has 302 places, 308 transitions, 648 flow [2025-02-06 08:59:07,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=302, PETRI_TRANSITIONS=308} [2025-02-06 08:59:07,438 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-02-06 08:59:07,438 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 308 transitions, 648 flow [2025-02-06 08:59:07,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:07,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:07,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:59:07,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:59:07,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:59:07,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash 319988109, now seen corresponding path program 1 times [2025-02-06 08:59:07,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:07,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295172860] [2025-02-06 08:59:07,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:07,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:59:07,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:59:07,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:07,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:07,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:07,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295172860] [2025-02-06 08:59:07,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295172860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:59:07,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370804734] [2025-02-06 08:59:07,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:07,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:59:07,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:59:07,500 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:59:07,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 08:59:07,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:59:07,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:59:07,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:07,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:07,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 08:59:07,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:59:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:59:07,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:59:07,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370804734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:59:07,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:59:07,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-06 08:59:07,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112205813] [2025-02-06 08:59:07,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:59:07,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:59:07,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:07,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:59:07,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:59:07,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 332 [2025-02-06 08:59:07,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 308 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:07,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:07,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 332 [2025-02-06 08:59:07,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:08,431 INFO L124 PetriNetUnfolderBase]: 1136/6735 cut-off events. [2025-02-06 08:59:08,431 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-02-06 08:59:08,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8351 conditions, 6735 events. 1136/6735 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 70769 event pairs, 690 based on Foata normal form. 40/5788 useless extension candidates. Maximal degree in co-relation 8303. Up to 1091 conditions per place. [2025-02-06 08:59:08,513 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 27 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-02-06 08:59:08,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 318 transitions, 741 flow [2025-02-06 08:59:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:59:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:59:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions. [2025-02-06 08:59:08,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9216867469879518 [2025-02-06 08:59:08,516 INFO L175 Difference]: Start difference. First operand has 302 places, 308 transitions, 648 flow. Second operand 3 states and 918 transitions. [2025-02-06 08:59:08,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 318 transitions, 741 flow [2025-02-06 08:59:08,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 318 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:59:08,521 INFO L231 Difference]: Finished difference. Result has 304 places, 309 transitions, 658 flow [2025-02-06 08:59:08,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=304, PETRI_TRANSITIONS=309} [2025-02-06 08:59:08,522 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-02-06 08:59:08,522 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 309 transitions, 658 flow [2025-02-06 08:59:08,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:08,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:08,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:59:08,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 08:59:08,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:59:08,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:59:08,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2076401757, now seen corresponding path program 1 times [2025-02-06 08:59:08,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:08,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874482471] [2025-02-06 08:59:08,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:08,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:08,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:59:08,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:59:08,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:08,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:08,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:08,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874482471] [2025-02-06 08:59:08,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874482471] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:59:08,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811174191] [2025-02-06 08:59:08,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:08,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:59:08,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:59:08,787 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:59:08,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 08:59:08,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:59:08,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:59:08,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:08,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:08,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 08:59:08,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:59:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:08,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:59:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:08,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811174191] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:59:08,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:59:08,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 08:59:08,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578016219] [2025-02-06 08:59:08,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:59:08,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:59:08,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:08,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:59:08,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:59:08,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2025-02-06 08:59:08,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 309 transitions, 658 flow. Second operand has 10 states, 10 states have (on average 296.2) internal successors, (2962), 10 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:08,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:08,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2025-02-06 08:59:08,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:09,533 INFO L124 PetriNetUnfolderBase]: 366/3121 cut-off events. [2025-02-06 08:59:09,533 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-02-06 08:59:09,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 3121 events. 366/3121 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26782 event pairs, 204 based on Foata normal form. 2/2699 useless extension candidates. Maximal degree in co-relation 3504. Up to 330 conditions per place. [2025-02-06 08:59:09,589 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 20 selfloop transitions, 9 changer transitions 0/317 dead transitions. [2025-02-06 08:59:09,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 317 transitions, 734 flow [2025-02-06 08:59:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:59:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 08:59:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2677 transitions. [2025-02-06 08:59:09,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8959170013386881 [2025-02-06 08:59:09,592 INFO L175 Difference]: Start difference. First operand has 304 places, 309 transitions, 658 flow. Second operand 9 states and 2677 transitions. [2025-02-06 08:59:09,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 317 transitions, 734 flow [2025-02-06 08:59:09,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 317 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:59:09,597 INFO L231 Difference]: Finished difference. Result has 314 places, 315 transitions, 706 flow [2025-02-06 08:59:09,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=706, PETRI_PLACES=314, PETRI_TRANSITIONS=315} [2025-02-06 08:59:09,598 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 2 predicate places. [2025-02-06 08:59:09,598 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 315 transitions, 706 flow [2025-02-06 08:59:09,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 296.2) internal successors, (2962), 10 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:09,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:09,600 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2025-02-06 08:59:09,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 08:59:09,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:59:09,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:59:09,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1613897949, now seen corresponding path program 2 times [2025-02-06 08:59:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:09,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391183745] [2025-02-06 08:59:09,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:59:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:09,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-06 08:59:09,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 08:59:09,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:59:09,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:09,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391183745] [2025-02-06 08:59:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391183745] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:59:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463624026] [2025-02-06 08:59:09,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:59:09,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:59:09,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:59:09,999 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:59:10,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 08:59:10,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-06 08:59:10,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 08:59:10,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:59:10,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:10,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 08:59:10,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:59:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:10,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:59:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:10,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463624026] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:59:10,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:59:10,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-06 08:59:10,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544002898] [2025-02-06 08:59:10,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:59:10,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 08:59:10,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:10,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 08:59:10,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:59:10,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2025-02-06 08:59:10,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 315 transitions, 706 flow. Second operand has 15 states, 15 states have (on average 296.26666666666665) internal successors, (4444), 15 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:10,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:10,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2025-02-06 08:59:10,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:11,065 INFO L124 PetriNetUnfolderBase]: 366/3160 cut-off events. [2025-02-06 08:59:11,065 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-02-06 08:59:11,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3693 conditions, 3160 events. 366/3160 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26710 event pairs, 204 based on Foata normal form. 3/2739 useless extension candidates. Maximal degree in co-relation 3508. Up to 330 conditions per place. [2025-02-06 08:59:11,120 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 23 selfloop transitions, 18 changer transitions 0/329 dead transitions. [2025-02-06 08:59:11,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 329 transitions, 862 flow [2025-02-06 08:59:11,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 08:59:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 08:59:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5336 transitions. [2025-02-06 08:59:11,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.892904953145917 [2025-02-06 08:59:11,125 INFO L175 Difference]: Start difference. First operand has 314 places, 315 transitions, 706 flow. Second operand 18 states and 5336 transitions. [2025-02-06 08:59:11,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 329 transitions, 862 flow [2025-02-06 08:59:11,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 329 transitions, 850 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 08:59:11,130 INFO L231 Difference]: Finished difference. Result has 334 places, 325 transitions, 806 flow [2025-02-06 08:59:11,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=806, PETRI_PLACES=334, PETRI_TRANSITIONS=325} [2025-02-06 08:59:11,130 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 22 predicate places. [2025-02-06 08:59:11,130 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 325 transitions, 806 flow [2025-02-06 08:59:11,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 296.26666666666665) internal successors, (4444), 15 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:11,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:11,132 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1] [2025-02-06 08:59:11,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 08:59:11,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:59:11,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:59:11,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2133108879, now seen corresponding path program 3 times [2025-02-06 08:59:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:11,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692479301] [2025-02-06 08:59:11,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 08:59:11,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:11,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 7 equivalence classes. [2025-02-06 08:59:11,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 08:59:11,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 08:59:11,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:59:11,370 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:59:11,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 08:59:11,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 08:59:11,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:11,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:59:11,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:59:11,396 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-02-06 08:59:11,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-02-06 08:59:11,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-02-06 08:59:11,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-02-06 08:59:11,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-02-06 08:59:11,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-02-06 08:59:11,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-02-06 08:59:11,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-02-06 08:59:11,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-02-06 08:59:11,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-02-06 08:59:11,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 08:59:11,397 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-02-06 08:59:11,397 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:59:11,400 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-06 08:59:11,462 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:59:11,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 402 transitions, 844 flow [2025-02-06 08:59:11,525 INFO L124 PetriNetUnfolderBase]: 36/445 cut-off events. [2025-02-06 08:59:11,525 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 08:59:11,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 445 events. 36/445 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1784 event pairs, 0 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 379. Up to 6 conditions per place. [2025-02-06 08:59:11,533 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 402 transitions, 844 flow [2025-02-06 08:59:11,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 402 transitions, 844 flow [2025-02-06 08:59:11,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:59:11,541 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;@452158ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:59:11,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-06 08:59:11,544 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:59:11,544 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-06 08:59:11,544 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:59:11,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:11,544 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] [2025-02-06 08:59:11,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 08:59:11,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:11,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1553237538, now seen corresponding path program 1 times [2025-02-06 08:59:11,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:11,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935840816] [2025-02-06 08:59:11,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:11,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:11,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 08:59:11,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 08:59:11,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:11,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:11,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:11,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935840816] [2025-02-06 08:59:11,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935840816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:59:11,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:59:11,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:59:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651754579] [2025-02-06 08:59:11,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:59:11,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:59:11,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:11,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:59:11,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:59:12,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 402 [2025-02-06 08:59:12,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 402 transitions, 844 flow. Second operand has 6 states, 6 states have (on average 334.5) internal successors, (2007), 6 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:12,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:12,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 402 [2025-02-06 08:59:12,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand