./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.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/09_fmaxsym.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 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:58:41,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:58:41,390 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:41,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:58:41,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:58:41,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:58:41,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:58:41,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:58:41,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:58:41,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:58:41,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:58:41,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:58:41,422 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:58:41,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:58:41,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:58:41,422 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:58:41,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:58:41,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:58:41,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:58:41,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:58:41,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:58:41,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:58:41,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:58:41,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:58:41,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:58:41,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:58:41,426 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 -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-02-06 08:58:41,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:58:41,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:58:41,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:58:41,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:58:41,650 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:58:41,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-02-06 08:58:42,789 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f80775fa1/4cd37c8987c34ee8aae37f1c86f420ad/FLAG8ec4692aa [2025-02-06 08:58:43,080 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:58:43,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-02-06 08:58:43,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f80775fa1/4cd37c8987c34ee8aae37f1c86f420ad/FLAG8ec4692aa [2025-02-06 08:58:43,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f80775fa1/4cd37c8987c34ee8aae37f1c86f420ad [2025-02-06 08:58:43,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:58:43,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:58:43,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:58:43,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:58:43,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:58:43,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:58:43" (1/1) ... [2025-02-06 08:58:43,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0fe948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:43, skipping insertion in model container [2025-02-06 08:58:43,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:58:43" (1/1) ... [2025-02-06 08:58:43,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:58:43,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:58:43,433 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:58:43,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:58:43,495 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:58:43,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:43 WrapperNode [2025-02-06 08:58:43,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:58:43,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:58:43,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:58:43,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:58:43,501 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:43" (1/1) ... [2025-02-06 08:58:43,508 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:43" (1/1) ... [2025-02-06 08:58:43,527 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 103 [2025-02-06 08:58:43,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:58:43,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:58:43,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:58:43,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:58:43,534 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:43" (1/1) ... [2025-02-06 08:58:43,535 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:43" (1/1) ... [2025-02-06 08:58:43,540 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:43" (1/1) ... [2025-02-06 08:58:43,541 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:43" (1/1) ... [2025-02-06 08:58:43,554 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:43" (1/1) ... [2025-02-06 08:58:43,555 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:43" (1/1) ... [2025-02-06 08:58:43,556 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:43" (1/1) ... [2025-02-06 08:58:43,557 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:43" (1/1) ... [2025-02-06 08:58:43,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:58:43,559 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:58:43,559 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:58:43,559 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:58:43,560 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:43" (1/1) ... [2025-02-06 08:58:43,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:58:43,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:43,593 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:43,594 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:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 08:58:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 08:58:43,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 08:58:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 08:58:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 08:58:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:58:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 08:58:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 08:58:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:58:43,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:58:43,612 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:43,719 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:58:43,722 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:58:43,939 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 08:58:43,939 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:58:43,957 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:58:43,958 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 08:58:43,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:58:43 BoogieIcfgContainer [2025-02-06 08:58:43,958 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:58:43,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:58:43,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:58:43,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:58:43,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:58:43" (1/3) ... [2025-02-06 08:58:43,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3edf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:58:43, skipping insertion in model container [2025-02-06 08:58:43,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:43" (2/3) ... [2025-02-06 08:58:43,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3edf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:58:43, skipping insertion in model container [2025-02-06 08:58:43,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:58:43" (3/3) ... [2025-02-06 08:58:43,966 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-02-06 08:58:43,978 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:58:43,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 114 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-02-06 08:58:43,981 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 08:58:44,052 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:58:44,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 120 transitions, 244 flow [2025-02-06 08:58:44,134 INFO L124 PetriNetUnfolderBase]: 6/127 cut-off events. [2025-02-06 08:58:44,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:58:44,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2025-02-06 08:58:44,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 120 transitions, 244 flow [2025-02-06 08:58:44,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 120 transitions, 244 flow [2025-02-06 08:58:44,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:58:44,158 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;@2ad07227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:58:44,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 08:58:44,170 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:58:44,171 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-06 08:58:44,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:58:44,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:44,172 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:44,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 08:58:44,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash -280794531, now seen corresponding path program 1 times [2025-02-06 08:58:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:44,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212880142] [2025-02-06 08:58:44,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:44,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:44,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 08:58:44,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 08:58:44,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:44,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:44,760 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:44,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212880142] [2025-02-06 08:58:44,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212880142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:44,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:44,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:58:44,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56954626] [2025-02-06 08:58:44,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:44,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:58:44,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:44,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:58:44,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:58:44,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2025-02-06 08:58:44,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 120 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 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:44,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:44,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2025-02-06 08:58:44,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:45,016 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2025-02-06 08:58:45,017 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 08:58:45,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 113 events. 3/113 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 13/117 useless extension candidates. Maximal degree in co-relation 75. Up to 16 conditions per place. [2025-02-06 08:58:45,018 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 15 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-02-06 08:58:45,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 110 transitions, 264 flow [2025-02-06 08:58:45,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:58:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:58:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2025-02-06 08:58:45,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-02-06 08:58:45,036 INFO L175 Difference]: Start difference. First operand has 117 places, 120 transitions, 244 flow. Second operand 6 states and 583 transitions. [2025-02-06 08:58:45,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 110 transitions, 264 flow [2025-02-06 08:58:45,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 110 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:45,045 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 234 flow [2025-02-06 08:58:45,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2025-02-06 08:58:45,052 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-02-06 08:58:45,052 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 234 flow [2025-02-06 08:58:45,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 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:45,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:45,053 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:45,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:58:45,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 08:58:45,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash -714229618, now seen corresponding path program 1 times [2025-02-06 08:58:45,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:45,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748696914] [2025-02-06 08:58:45,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:45,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:45,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 08:58:45,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 08:58:45,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:45,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:45,142 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:45,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:45,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748696914] [2025-02-06 08:58:45,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748696914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:45,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:45,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:58:45,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32445688] [2025-02-06 08:58:45,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:45,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:58:45,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:45,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:58:45,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:58:45,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 120 [2025-02-06 08:58:45,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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:45,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:45,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 120 [2025-02-06 08:58:45,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:45,206 INFO L124 PetriNetUnfolderBase]: 3/125 cut-off events. [2025-02-06 08:58:45,207 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 08:58:45,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 125 events. 3/125 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 90. Up to 11 conditions per place. [2025-02-06 08:58:45,207 INFO L140 encePairwiseOnDemand]: 117/120 looper letters, 9 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-02-06 08:58:45,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 260 flow [2025-02-06 08:58:45,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:58:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:58:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-02-06 08:58:45,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9 [2025-02-06 08:58:45,209 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 234 flow. Second operand 3 states and 324 transitions. [2025-02-06 08:58:45,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 260 flow [2025-02-06 08:58:45,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 111 transitions, 248 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:58:45,211 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 236 flow [2025-02-06 08:58:45,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=113, PETRI_TRANSITIONS=111} [2025-02-06 08:58:45,213 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2025-02-06 08:58:45,213 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 236 flow [2025-02-06 08:58:45,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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:45,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:45,214 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:45,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:58:45,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 08:58:45,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1376890318, now seen corresponding path program 1 times [2025-02-06 08:58:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:45,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470936859] [2025-02-06 08:58:45,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:45,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 08:58:45,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 08:58:45,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:45,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:45,317 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:45,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:45,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470936859] [2025-02-06 08:58:45,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470936859] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:58:45,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030169856] [2025-02-06 08:58:45,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:45,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:45,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:45,321 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:45,322 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:45,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 08:58:45,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 08:58:45,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:45,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:45,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 08:58:45,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:58:45,432 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:45,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:58:45,481 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:45,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030169856] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:58:45,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:58:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 08:58:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526067747] [2025-02-06 08:58:45,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:58:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:58:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:45,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:58:45,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:58:45,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 120 [2025-02-06 08:58:45,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 111 transitions, 236 flow. Second operand has 10 states, 10 states have (on average 102.9) internal successors, (1029), 10 states have internal predecessors, (1029), 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:45,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:45,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 120 [2025-02-06 08:58:45,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:45,637 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2025-02-06 08:58:45,637 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 08:58:45,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 140 events. 3/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 125. Up to 11 conditions per place. [2025-02-06 08:58:45,637 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 13 selfloop transitions, 9 changer transitions 0/119 dead transitions. [2025-02-06 08:58:45,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 298 flow [2025-02-06 08:58:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:58:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 08:58:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 933 transitions. [2025-02-06 08:58:45,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8638888888888889 [2025-02-06 08:58:45,641 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 236 flow. Second operand 9 states and 933 transitions. [2025-02-06 08:58:45,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 298 flow [2025-02-06 08:58:45,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 119 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:58:45,645 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 284 flow [2025-02-06 08:58:45,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=284, PETRI_PLACES=123, PETRI_TRANSITIONS=117} [2025-02-06 08:58:45,646 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-02-06 08:58:45,646 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 284 flow [2025-02-06 08:58:45,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 102.9) internal successors, (1029), 10 states have internal predecessors, (1029), 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:45,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:45,647 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:45,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 08:58:45,853 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:45,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 08:58:45,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:45,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1215666098, now seen corresponding path program 2 times [2025-02-06 08:58:45,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:45,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532941970] [2025-02-06 08:58:45,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:58:45,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:45,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-06 08:58:45,888 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:45,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:58:45,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:46,046 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:46,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:46,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532941970] [2025-02-06 08:58:46,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532941970] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:58:46,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526927017] [2025-02-06 08:58:46,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:58:46,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:46,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:46,048 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:46,050 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:46,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-06 08:58:46,128 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:46,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:58:46,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:46,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 08:58:46,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:58:46,216 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:46,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:58:46,328 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:46,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526927017] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:58:46,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:58:46,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-06 08:58:46,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343256942] [2025-02-06 08:58:46,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:58:46,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 08:58:46,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:46,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 08:58:46,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:58:46,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 120 [2025-02-06 08:58:46,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 284 flow. Second operand has 15 states, 15 states have (on average 103.06666666666666) internal successors, (1546), 15 states have internal predecessors, (1546), 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:46,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:46,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 120 [2025-02-06 08:58:46,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:46,621 INFO L124 PetriNetUnfolderBase]: 3/179 cut-off events. [2025-02-06 08:58:46,621 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-06 08:58:46,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 179 events. 3/179 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 3/174 useless extension candidates. Maximal degree in co-relation 185. Up to 11 conditions per place. [2025-02-06 08:58:46,622 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 16 selfloop transitions, 18 changer transitions 0/131 dead transitions. [2025-02-06 08:58:46,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 131 transitions, 426 flow [2025-02-06 08:58:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 08:58:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 08:58:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1855 transitions. [2025-02-06 08:58:46,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8587962962962963 [2025-02-06 08:58:46,630 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 284 flow. Second operand 18 states and 1855 transitions. [2025-02-06 08:58:46,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 131 transitions, 426 flow [2025-02-06 08:58:46,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 131 transitions, 414 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 08:58:46,635 INFO L231 Difference]: Finished difference. Result has 143 places, 127 transitions, 384 flow [2025-02-06 08:58:46,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=384, PETRI_PLACES=143, PETRI_TRANSITIONS=127} [2025-02-06 08:58:46,637 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2025-02-06 08:58:46,637 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 127 transitions, 384 flow [2025-02-06 08:58:46,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 103.06666666666666) internal successors, (1546), 15 states have internal predecessors, (1546), 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:46,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:46,639 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:46,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 08:58:46,843 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:46,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 08:58:46,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:46,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1620490254, now seen corresponding path program 3 times [2025-02-06 08:58:46,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:46,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751938864] [2025-02-06 08:58:46,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 08:58:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:46,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 7 equivalence classes. [2025-02-06 08:58:46,898 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:46,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 08:58:46,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:46,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:58:46,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 08:58:46,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 08:58:46,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:46,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:46,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:58:46,946 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:58:46,947 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-06 08:58:46,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-06 08:58:46,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-06 08:58:46,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-06 08:58:46,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-06 08:58:46,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-06 08:58:46,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-06 08:58:46,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-06 08:58:46,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-06 08:58:46,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-06 08:58:46,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:58:46,949 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-02-06 08:58:46,951 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:58:46,951 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 08:58:46,993 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:58:46,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 188 transitions, 386 flow [2025-02-06 08:58:47,010 INFO L124 PetriNetUnfolderBase]: 11/204 cut-off events. [2025-02-06 08:58:47,010 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 08:58:47,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 204 events. 11/204 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 393 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 143. Up to 3 conditions per place. [2025-02-06 08:58:47,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 188 transitions, 386 flow [2025-02-06 08:58:47,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 188 transitions, 386 flow [2025-02-06 08:58:47,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:58:47,014 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;@2ad07227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:58:47,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-06 08:58:47,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:58:47,017 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-06 08:58:47,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:58:47,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:47,017 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:47,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 08:58:47,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash 201509785, now seen corresponding path program 1 times [2025-02-06 08:58:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:47,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978633221] [2025-02-06 08:58:47,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:47,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:47,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 08:58:47,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 08:58:47,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:47,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:47,171 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:47,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:47,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978633221] [2025-02-06 08:58:47,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978633221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:47,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:47,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:58:47,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845977193] [2025-02-06 08:58:47,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:47,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:58:47,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:47,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:58:47,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:58:47,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 188 [2025-02-06 08:58:47,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 188 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 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:58:47,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:47,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 188 [2025-02-06 08:58:47,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:47,427 INFO L124 PetriNetUnfolderBase]: 104/725 cut-off events. [2025-02-06 08:58:47,428 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 08:58:47,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 725 events. 104/725 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3754 event pairs, 72 based on Foata normal form. 136/754 useless extension candidates. Maximal degree in co-relation 669. Up to 185 conditions per place. [2025-02-06 08:58:47,435 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 24 selfloop transitions, 5 changer transitions 0/173 dead transitions. [2025-02-06 08:58:47,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 173 transitions, 414 flow [2025-02-06 08:58:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:58:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:58:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 925 transitions. [2025-02-06 08:58:47,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8200354609929078 [2025-02-06 08:58:47,437 INFO L175 Difference]: Start difference. First operand has 182 places, 188 transitions, 386 flow. Second operand 6 states and 925 transitions. [2025-02-06 08:58:47,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 173 transitions, 414 flow [2025-02-06 08:58:47,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 173 transitions, 414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:47,441 INFO L231 Difference]: Finished difference. Result has 178 places, 173 transitions, 366 flow [2025-02-06 08:58:47,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=178, PETRI_TRANSITIONS=173} [2025-02-06 08:58:47,443 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -4 predicate places. [2025-02-06 08:58:47,444 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 173 transitions, 366 flow [2025-02-06 08:58:47,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 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:58:47,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:47,444 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:47,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:58:47,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 08:58:47,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:47,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1506341509, now seen corresponding path program 1 times [2025-02-06 08:58:47,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:47,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845400950] [2025-02-06 08:58:47,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:47,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:47,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 08:58:47,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 08:58:47,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:47,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:47,478 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:47,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:47,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845400950] [2025-02-06 08:58:47,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845400950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:47,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:47,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:58:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952868033] [2025-02-06 08:58:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:47,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:58:47,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:47,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:58:47,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:58:47,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 188 [2025-02-06 08:58:47,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 173 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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:47,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:47,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 188 [2025-02-06 08:58:47,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:47,575 INFO L124 PetriNetUnfolderBase]: 33/489 cut-off events. [2025-02-06 08:58:47,576 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-06 08:58:47,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 489 events. 33/489 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2027 event pairs, 20 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 514. Up to 56 conditions per place. [2025-02-06 08:58:47,580 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2025-02-06 08:58:47,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 174 transitions, 402 flow [2025-02-06 08:58:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:58:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:58:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-02-06 08:58:47,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-02-06 08:58:47,582 INFO L175 Difference]: Start difference. First operand has 178 places, 173 transitions, 366 flow. Second operand 3 states and 506 transitions. [2025-02-06 08:58:47,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 174 transitions, 402 flow [2025-02-06 08:58:47,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 174 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:58:47,585 INFO L231 Difference]: Finished difference. Result has 176 places, 174 transitions, 368 flow [2025-02-06 08:58:47,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=176, PETRI_TRANSITIONS=174} [2025-02-06 08:58:47,588 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -6 predicate places. [2025-02-06 08:58:47,588 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 174 transitions, 368 flow [2025-02-06 08:58:47,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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:47,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:47,589 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:47,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:58:47,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 08:58:47,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash -398308635, now seen corresponding path program 1 times [2025-02-06 08:58:47,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:47,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483724512] [2025-02-06 08:58:47,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:47,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 08:58:47,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 08:58:47,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:47,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:47,653 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:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:47,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483724512] [2025-02-06 08:58:47,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483724512] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:58:47,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64849073] [2025-02-06 08:58:47,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:47,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:47,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:47,658 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:47,661 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:47,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 08:58:47,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 08:58:47,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:47,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:47,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 08:58:47,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:58:47,780 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:47,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:58:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64849073] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:58:47,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:58:47,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 08:58:47,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217189838] [2025-02-06 08:58:47,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:58:47,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:58:47,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:47,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:58:47,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:58:47,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-02-06 08:58:47,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 174 transitions, 368 flow. Second operand has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 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:47,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:47,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-02-06 08:58:47,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:47,987 INFO L124 PetriNetUnfolderBase]: 33/504 cut-off events. [2025-02-06 08:58:47,987 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-06 08:58:47,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 504 events. 33/504 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1998 event pairs, 20 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 549. Up to 56 conditions per place. [2025-02-06 08:58:47,990 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 18 selfloop transitions, 9 changer transitions 0/182 dead transitions. [2025-02-06 08:58:47,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 182 transitions, 440 flow [2025-02-06 08:58:47,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:58:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 08:58:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1469 transitions. [2025-02-06 08:58:47,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682033096926713 [2025-02-06 08:58:47,993 INFO L175 Difference]: Start difference. First operand has 176 places, 174 transitions, 368 flow. Second operand 9 states and 1469 transitions. [2025-02-06 08:58:47,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 182 transitions, 440 flow [2025-02-06 08:58:47,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:58:47,995 INFO L231 Difference]: Finished difference. Result has 186 places, 180 transitions, 416 flow [2025-02-06 08:58:47,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=416, PETRI_PLACES=186, PETRI_TRANSITIONS=180} [2025-02-06 08:58:47,996 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-02-06 08:58:47,996 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 180 transitions, 416 flow [2025-02-06 08:58:47,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 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:47,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:47,997 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:48,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 08:58:48,198 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:48,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 08:58:48,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1404752155, now seen corresponding path program 2 times [2025-02-06 08:58:48,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:48,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733144582] [2025-02-06 08:58:48,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:58:48,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:48,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-06 08:58:48,214 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:48,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:58:48,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:48,357 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:48,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:48,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733144582] [2025-02-06 08:58:48,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733144582] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:58:48,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541664681] [2025-02-06 08:58:48,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:58:48,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:48,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:48,360 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:48,361 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:48,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-06 08:58:48,435 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:48,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:58:48,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:48,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 08:58:48,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:58:48,491 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:48,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:58:48,583 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:48,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541664681] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:58:48,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:58:48,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-06 08:58:48,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618936648] [2025-02-06 08:58:48,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:58:48,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 08:58:48,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:48,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 08:58:48,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:58:48,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-02-06 08:58:48,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 180 transitions, 416 flow. Second operand has 15 states, 15 states have (on average 162.13333333333333) internal successors, (2432), 15 states have internal predecessors, (2432), 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:48,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:48,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-02-06 08:58:48,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:48,889 INFO L124 PetriNetUnfolderBase]: 33/543 cut-off events. [2025-02-06 08:58:48,889 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-06 08:58:48,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 543 events. 33/543 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1972 event pairs, 20 based on Foata normal form. 3/497 useless extension candidates. Maximal degree in co-relation 511. Up to 56 conditions per place. [2025-02-06 08:58:48,892 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 21 selfloop transitions, 18 changer transitions 0/194 dead transitions. [2025-02-06 08:58:48,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 194 transitions, 568 flow [2025-02-06 08:58:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 08:58:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 08:58:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2922 transitions. [2025-02-06 08:58:48,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8634751773049646 [2025-02-06 08:58:48,898 INFO L175 Difference]: Start difference. First operand has 186 places, 180 transitions, 416 flow. Second operand 18 states and 2922 transitions. [2025-02-06 08:58:48,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 194 transitions, 568 flow [2025-02-06 08:58:48,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 194 transitions, 556 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 08:58:48,902 INFO L231 Difference]: Finished difference. Result has 206 places, 190 transitions, 516 flow [2025-02-06 08:58:48,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=516, PETRI_PLACES=206, PETRI_TRANSITIONS=190} [2025-02-06 08:58:48,902 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 24 predicate places. [2025-02-06 08:58:48,902 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 190 transitions, 516 flow [2025-02-06 08:58:48,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 162.13333333333333) internal successors, (2432), 15 states have internal predecessors, (2432), 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:48,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:48,904 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:48,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 08:58:49,108 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:49,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-06 08:58:49,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:49,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1979172485, now seen corresponding path program 3 times [2025-02-06 08:58:49,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:49,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796434875] [2025-02-06 08:58:49,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 08:58:49,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:49,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-02-06 08:58:49,154 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:49,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-06 08:58:49,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:49,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:58:49,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 08:58:49,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 08:58:49,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:49,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:49,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:58:49,189 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:58:49,189 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-02-06 08:58:49,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-02-06 08:58:49,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-02-06 08:58:49,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-02-06 08:58:49,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-02-06 08:58:49,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-02-06 08:58:49,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-02-06 08:58:49,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-02-06 08:58:49,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-02-06 08:58:49,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-02-06 08:58:49,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-02-06 08:58:49,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-02-06 08:58:49,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-02-06 08:58:49,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-02-06 08:58:49,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:58:49,191 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-02-06 08:58:49,192 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:58:49,192 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 08:58:49,226 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:58:49,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 256 transitions, 530 flow [2025-02-06 08:58:49,256 INFO L124 PetriNetUnfolderBase]: 16/281 cut-off events. [2025-02-06 08:58:49,256 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 08:58:49,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 281 events. 16/281 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 762 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 210. Up to 4 conditions per place. [2025-02-06 08:58:49,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 256 transitions, 530 flow [2025-02-06 08:58:49,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 256 transitions, 530 flow [2025-02-06 08:58:49,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:58:49,261 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;@2ad07227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:58:49,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-06 08:58:49,265 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:58:49,265 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-06 08:58:49,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:58:49,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:49,265 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:49,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 08:58:49,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:49,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1954851993, now seen corresponding path program 1 times [2025-02-06 08:58:49,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:49,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196544949] [2025-02-06 08:58:49,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:49,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:49,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 08:58:49,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 08:58:49,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:49,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:49,433 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:49,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:49,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196544949] [2025-02-06 08:58:49,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196544949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:49,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:49,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:58:49,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868976055] [2025-02-06 08:58:49,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:49,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:58:49,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:49,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:58:49,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:58:49,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 256 [2025-02-06 08:58:49,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 256 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 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:49,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:49,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 256 [2025-02-06 08:58:49,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:50,226 INFO L124 PetriNetUnfolderBase]: 1746/6791 cut-off events. [2025-02-06 08:58:50,227 INFO L125 PetriNetUnfolderBase]: For 526/526 co-relation queries the response was YES. [2025-02-06 08:58:50,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9602 conditions, 6791 events. 1746/6791 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 67121 event pairs, 1368 based on Foata normal form. 1463/7182 useless extension candidates. Maximal degree in co-relation 6429. Up to 2449 conditions per place. [2025-02-06 08:58:50,280 INFO L140 encePairwiseOnDemand]: 240/256 looper letters, 33 selfloop transitions, 5 changer transitions 0/236 dead transitions. [2025-02-06 08:58:50,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 236 transitions, 566 flow [2025-02-06 08:58:50,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:58:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:58:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1267 transitions. [2025-02-06 08:58:50,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8248697916666666 [2025-02-06 08:58:50,284 INFO L175 Difference]: Start difference. First operand has 247 places, 256 transitions, 530 flow. Second operand 6 states and 1267 transitions. [2025-02-06 08:58:50,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 236 transitions, 566 flow [2025-02-06 08:58:50,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 236 transitions, 564 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:50,288 INFO L231 Difference]: Finished difference. Result has 241 places, 236 transitions, 498 flow [2025-02-06 08:58:50,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=241, PETRI_TRANSITIONS=236} [2025-02-06 08:58:50,289 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -6 predicate places. [2025-02-06 08:58:50,289 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 236 transitions, 498 flow [2025-02-06 08:58:50,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 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:50,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:50,290 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:58:50,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:58:50,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 08:58:50,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:50,291 INFO L85 PathProgramCache]: Analyzing trace with hash -462206525, now seen corresponding path program 1 times [2025-02-06 08:58:50,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:50,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186330097] [2025-02-06 08:58:50,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:50,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:50,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 08:58:50,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 08:58:50,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:50,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:50,310 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:50,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:50,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186330097] [2025-02-06 08:58:50,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186330097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:50,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:50,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:58:50,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820373390] [2025-02-06 08:58:50,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:50,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:58:50,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:50,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:58:50,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:58:50,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 256 [2025-02-06 08:58:50,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 236 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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:50,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:50,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 256 [2025-02-06 08:58:50,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:50,576 INFO L124 PetriNetUnfolderBase]: 283/2409 cut-off events. [2025-02-06 08:58:50,577 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-02-06 08:58:50,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2898 conditions, 2409 events. 283/2409 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 19674 event pairs, 220 based on Foata normal form. 1/2155 useless extension candidates. Maximal degree in co-relation 2834. Up to 381 conditions per place. [2025-02-06 08:58:50,596 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 19 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2025-02-06 08:58:50,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 237 transitions, 544 flow [2025-02-06 08:58:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:58:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:58:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-02-06 08:58:50,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8958333333333334 [2025-02-06 08:58:50,598 INFO L175 Difference]: Start difference. First operand has 241 places, 236 transitions, 498 flow. Second operand 3 states and 688 transitions. [2025-02-06 08:58:50,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 237 transitions, 544 flow [2025-02-06 08:58:50,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 237 transitions, 532 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:58:50,601 INFO L231 Difference]: Finished difference. Result has 239 places, 237 transitions, 500 flow [2025-02-06 08:58:50,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=239, PETRI_TRANSITIONS=237} [2025-02-06 08:58:50,602 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -8 predicate places. [2025-02-06 08:58:50,602 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 237 transitions, 500 flow [2025-02-06 08:58:50,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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:50,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:50,603 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:58:50,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:58:50,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 08:58:50,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1312957661, now seen corresponding path program 1 times [2025-02-06 08:58:50,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:50,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165311632] [2025-02-06 08:58:50,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:50,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:50,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 08:58:50,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 08:58:50,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:50,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:50,651 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:50,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:50,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165311632] [2025-02-06 08:58:50,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165311632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:58:50,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913887683] [2025-02-06 08:58:50,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:50,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:50,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:50,654 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:58:50,656 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:58:50,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 08:58:50,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 08:58:50,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:50,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:50,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 08:58:50,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:58:50,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:50,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:58:50,802 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:50,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913887683] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:58:50,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:58:50,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 08:58:50,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278945462] [2025-02-06 08:58:50,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:58:50,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:58:50,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:50,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:58:50,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:58:50,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 256 [2025-02-06 08:58:50,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 237 transitions, 500 flow. Second operand has 10 states, 10 states have (on average 221.1) internal successors, (2211), 10 states have internal predecessors, (2211), 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:50,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:50,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 256 [2025-02-06 08:58:50,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:51,162 INFO L124 PetriNetUnfolderBase]: 283/2424 cut-off events. [2025-02-06 08:58:51,162 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-02-06 08:58:51,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 2424 events. 283/2424 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 19658 event pairs, 220 based on Foata normal form. 2/2171 useless extension candidates. Maximal degree in co-relation 2869. Up to 381 conditions per place. [2025-02-06 08:58:51,186 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 23 selfloop transitions, 9 changer transitions 0/245 dead transitions. [2025-02-06 08:58:51,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 245 transitions, 582 flow [2025-02-06 08:58:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:58:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 08:58:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2005 transitions. [2025-02-06 08:58:51,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702256944444444 [2025-02-06 08:58:51,190 INFO L175 Difference]: Start difference. First operand has 239 places, 237 transitions, 500 flow. Second operand 9 states and 2005 transitions. [2025-02-06 08:58:51,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 245 transitions, 582 flow [2025-02-06 08:58:51,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 245 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:58:51,195 INFO L231 Difference]: Finished difference. Result has 249 places, 243 transitions, 548 flow [2025-02-06 08:58:51,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=548, PETRI_PLACES=249, PETRI_TRANSITIONS=243} [2025-02-06 08:58:51,196 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-02-06 08:58:51,196 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 548 flow [2025-02-06 08:58:51,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 221.1) internal successors, (2211), 10 states have internal predecessors, (2211), 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:51,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:51,197 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:58:51,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 08:58:51,401 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:58:51,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 08:58:51,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1824530211, now seen corresponding path program 2 times [2025-02-06 08:58:51,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:51,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795587679] [2025-02-06 08:58:51,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:58:51,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:51,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-02-06 08:58:51,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:58:51,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:58:51,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:51,499 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:51,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:51,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795587679] [2025-02-06 08:58:51,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795587679] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:58:51,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111747583] [2025-02-06 08:58:51,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:58:51,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:58:51,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:51,502 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:58:51,504 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:58:51,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-02-06 08:58:51,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:58:51,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:58:51,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:51,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 08:58:51,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:58:51,645 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:51,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:58:51,731 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:51,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111747583] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:58:51,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:58:51,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-06 08:58:51,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764897355] [2025-02-06 08:58:51,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:58:51,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 08:58:51,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:51,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 08:58:51,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:58:51,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 256 [2025-02-06 08:58:51,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 548 flow. Second operand has 15 states, 15 states have (on average 221.2) internal successors, (3318), 15 states have internal predecessors, (3318), 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:51,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:51,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 256 [2025-02-06 08:58:51,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:52,306 INFO L124 PetriNetUnfolderBase]: 283/2463 cut-off events. [2025-02-06 08:58:52,307 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-02-06 08:58:52,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3014 conditions, 2463 events. 283/2463 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 19584 event pairs, 220 based on Foata normal form. 3/2211 useless extension candidates. Maximal degree in co-relation 2831. Up to 381 conditions per place. [2025-02-06 08:58:52,325 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 26 selfloop transitions, 18 changer transitions 0/257 dead transitions. [2025-02-06 08:58:52,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 257 transitions, 710 flow [2025-02-06 08:58:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 08:58:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 08:58:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3989 transitions. [2025-02-06 08:58:52,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8656684027777778 [2025-02-06 08:58:52,332 INFO L175 Difference]: Start difference. First operand has 249 places, 243 transitions, 548 flow. Second operand 18 states and 3989 transitions. [2025-02-06 08:58:52,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 257 transitions, 710 flow [2025-02-06 08:58:52,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 257 transitions, 698 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 08:58:52,336 INFO L231 Difference]: Finished difference. Result has 269 places, 253 transitions, 648 flow [2025-02-06 08:58:52,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=648, PETRI_PLACES=269, PETRI_TRANSITIONS=253} [2025-02-06 08:58:52,337 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 22 predicate places. [2025-02-06 08:58:52,337 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 253 transitions, 648 flow [2025-02-06 08:58:52,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 221.2) internal successors, (3318), 15 states have internal predecessors, (3318), 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:52,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:52,339 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:58:52,346 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:58:52,539 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:58:52,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-06 08:58:52,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash -73925181, now seen corresponding path program 3 times [2025-02-06 08:58:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:52,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108874015] [2025-02-06 08:58:52,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 08:58:52,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:52,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 8 equivalence classes. [2025-02-06 08:58:52,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 08:58:52,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-06 08:58:52,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:52,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:58:52,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 08:58:52,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 08:58:52,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:52,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:52,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:58:52,612 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-02-06 08:58:52,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-02-06 08:58:52,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-02-06 08:58:52,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-02-06 08:58:52,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-02-06 08:58:52,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:58:52,613 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-02-06 08:58:52,614 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:58:52,614 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 08:58:52,653 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:58:52,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 324 transitions, 676 flow [2025-02-06 08:58:52,698 INFO L124 PetriNetUnfolderBase]: 21/358 cut-off events. [2025-02-06 08:58:52,698 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 08:58:52,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 358 events. 21/358 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1178 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 289. Up to 5 conditions per place. [2025-02-06 08:58:52,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 324 transitions, 676 flow [2025-02-06 08:58:52,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 324 transitions, 676 flow [2025-02-06 08:58:52,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:58:52,705 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;@2ad07227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:58:52,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-06 08:58:52,708 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:58:52,708 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-06 08:58:52,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:58:52,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:52,708 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:52,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:58:52,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:52,709 INFO L85 PathProgramCache]: Analyzing trace with hash 684264797, now seen corresponding path program 1 times [2025-02-06 08:58:52,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:52,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981996753] [2025-02-06 08:58:52,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:52,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:52,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 08:58:52,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 08:58:52,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:52,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:52,845 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:52,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:52,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981996753] [2025-02-06 08:58:52,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981996753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:52,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:52,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:58:52,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236389762] [2025-02-06 08:58:52,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:52,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:58:52,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:52,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:58:52,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:58:53,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 324 [2025-02-06 08:58:53,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 324 transitions, 676 flow. Second operand has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 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:53,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:53,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 324 [2025-02-06 08:58:53,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:00,030 INFO L124 PetriNetUnfolderBase]: 23093/67604 cut-off events. [2025-02-06 08:59:00,030 INFO L125 PetriNetUnfolderBase]: For 7852/7852 co-relation queries the response was YES. [2025-02-06 08:59:00,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101026 conditions, 67604 events. 23093/67604 cut-off events. For 7852/7852 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 897180 event pairs, 18864 based on Foata normal form. 15545/73239 useless extension candidates. Maximal degree in co-relation 60573. Up to 29414 conditions per place. [2025-02-06 08:59:00,792 INFO L140 encePairwiseOnDemand]: 305/324 looper letters, 42 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-02-06 08:59:00,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 720 flow [2025-02-06 08:59:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:59:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:59:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1609 transitions. [2025-02-06 08:59:00,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8276748971193416 [2025-02-06 08:59:00,796 INFO L175 Difference]: Start difference. First operand has 312 places, 324 transitions, 676 flow. Second operand 6 states and 1609 transitions. [2025-02-06 08:59:00,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 720 flow [2025-02-06 08:59:00,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 299 transitions, 714 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 08:59:00,802 INFO L231 Difference]: Finished difference. Result has 304 places, 299 transitions, 630 flow [2025-02-06 08:59:00,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=304, PETRI_TRANSITIONS=299} [2025-02-06 08:59:00,802 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-02-06 08:59:00,802 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 299 transitions, 630 flow [2025-02-06 08:59:00,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 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,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:00,803 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] [2025-02-06 08:59:00,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:59:00,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:59:00,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash -998798520, now seen corresponding path program 1 times [2025-02-06 08:59:00,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:00,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158358704] [2025-02-06 08:59:00,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:00,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:00,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 08:59:00,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 08:59:00,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:00,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:00,825 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,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:00,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158358704] [2025-02-06 08:59:00,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158358704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:59:00,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:59:00,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:59:00,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161553846] [2025-02-06 08:59:00,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:59:00,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:59:00,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:00,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:59:00,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:59:00,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 324 [2025-02-06 08:59:00,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 299 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 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,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:00,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 324 [2025-02-06 08:59:00,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:02,533 INFO L124 PetriNetUnfolderBase]: 2033/12509 cut-off events. [2025-02-06 08:59:02,533 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-02-06 08:59:02,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15499 conditions, 12509 events. 2033/12509 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 147666 event pairs, 1720 based on Foata normal form. 1/11224 useless extension candidates. Maximal degree in co-relation 15434. Up to 2506 conditions per place. [2025-02-06 08:59:02,633 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 24 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2025-02-06 08:59:02,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 300 transitions, 686 flow [2025-02-06 08:59:02,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:59:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:59:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 870 transitions. [2025-02-06 08:59:02,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8950617283950617 [2025-02-06 08:59:02,635 INFO L175 Difference]: Start difference. First operand has 304 places, 299 transitions, 630 flow. Second operand 3 states and 870 transitions. [2025-02-06 08:59:02,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 300 transitions, 686 flow [2025-02-06 08:59:02,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 300 transitions, 674 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:59:02,641 INFO L231 Difference]: Finished difference. Result has 302 places, 300 transitions, 632 flow [2025-02-06 08:59:02,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=302, PETRI_TRANSITIONS=300} [2025-02-06 08:59:02,642 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-02-06 08:59:02,642 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 300 transitions, 632 flow [2025-02-06 08:59:02,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 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,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:02,643 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:02,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:59:02,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:59:02,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:02,643 INFO L85 PathProgramCache]: Analyzing trace with hash 9651948, now seen corresponding path program 1 times [2025-02-06 08:59:02,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:02,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445078402] [2025-02-06 08:59:02,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:02,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:02,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:59:02,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:59:02,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:02,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:02,688 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:02,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:02,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445078402] [2025-02-06 08:59:02,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445078402] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:59:02,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911663865] [2025-02-06 08:59:02,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:02,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:59:02,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:59:02,690 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:02,692 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:02,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:59:02,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:59:02,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:02,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:02,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 08:59:02,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:59:02,802 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:02,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:59:02,828 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:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911663865] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:59:02,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:59:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 08:59:02,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781684976] [2025-02-06 08:59:02,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:59:02,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:59:02,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:02,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:59:02,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:59:02,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 324 [2025-02-06 08:59:02,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 300 transitions, 632 flow. Second operand has 10 states, 10 states have (on average 280.2) internal successors, (2802), 10 states have internal predecessors, (2802), 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,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:02,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 324 [2025-02-06 08:59:02,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:04,679 INFO L124 PetriNetUnfolderBase]: 2033/12524 cut-off events. [2025-02-06 08:59:04,679 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2025-02-06 08:59:04,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15522 conditions, 12524 events. 2033/12524 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 147597 event pairs, 1720 based on Foata normal form. 2/11240 useless extension candidates. Maximal degree in co-relation 15469. Up to 2506 conditions per place. [2025-02-06 08:59:04,808 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 28 selfloop transitions, 9 changer transitions 0/308 dead transitions. [2025-02-06 08:59:04,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 308 transitions, 724 flow [2025-02-06 08:59:04,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:59:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 08:59:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2541 transitions. [2025-02-06 08:59:04,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8713991769547325 [2025-02-06 08:59:04,811 INFO L175 Difference]: Start difference. First operand has 302 places, 300 transitions, 632 flow. Second operand 9 states and 2541 transitions. [2025-02-06 08:59:04,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 308 transitions, 724 flow [2025-02-06 08:59:04,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 308 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:59:04,818 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 680 flow [2025-02-06 08:59:04,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=680, PETRI_PLACES=312, PETRI_TRANSITIONS=306} [2025-02-06 08:59:04,818 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 0 predicate places. [2025-02-06 08:59:04,819 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 680 flow [2025-02-06 08:59:04,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 280.2) internal successors, (2802), 10 states have internal predecessors, (2802), 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:04,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:04,820 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:04,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 08:59:05,020 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:05,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:59:05,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:05,021 INFO L85 PathProgramCache]: Analyzing trace with hash 742083692, now seen corresponding path program 2 times [2025-02-06 08:59:05,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:05,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032702530] [2025-02-06 08:59:05,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:59:05,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:05,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-06 08:59:05,041 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:05,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:59:05,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:05,135 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:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032702530] [2025-02-06 08:59:05,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032702530] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:59:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199200026] [2025-02-06 08:59:05,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:59:05,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:59:05,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:59:05,138 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:05,140 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:05,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-06 08:59:05,239 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:05,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 08:59:05,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:05,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 08:59:05,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:59:05,296 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:05,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:59:05,379 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:05,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199200026] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:59:05,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:59:05,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-06 08:59:05,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283894750] [2025-02-06 08:59:05,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:59:05,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 08:59:05,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:05,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 08:59:05,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:59:05,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 324 [2025-02-06 08:59:05,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 306 transitions, 680 flow. Second operand has 15 states, 15 states have (on average 280.26666666666665) internal successors, (4204), 15 states have internal predecessors, (4204), 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:05,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:05,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 324 [2025-02-06 08:59:05,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:07,325 INFO L124 PetriNetUnfolderBase]: 2033/12563 cut-off events. [2025-02-06 08:59:07,326 INFO L125 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2025-02-06 08:59:07,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15615 conditions, 12563 events. 2033/12563 cut-off events. For 1239/1239 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 147610 event pairs, 1720 based on Foata normal form. 3/11280 useless extension candidates. Maximal degree in co-relation 15431. Up to 2506 conditions per place. [2025-02-06 08:59:07,519 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 31 selfloop transitions, 18 changer transitions 0/320 dead transitions. [2025-02-06 08:59:07,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 320 transitions, 852 flow [2025-02-06 08:59:07,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 08:59:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 08:59:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5056 transitions. [2025-02-06 08:59:07,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8669410150891632 [2025-02-06 08:59:07,525 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 680 flow. Second operand 18 states and 5056 transitions. [2025-02-06 08:59:07,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 320 transitions, 852 flow [2025-02-06 08:59:07,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 320 transitions, 840 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 08:59:07,535 INFO L231 Difference]: Finished difference. Result has 332 places, 316 transitions, 780 flow [2025-02-06 08:59:07,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=780, PETRI_PLACES=332, PETRI_TRANSITIONS=316} [2025-02-06 08:59:07,536 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 20 predicate places. [2025-02-06 08:59:07,536 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 316 transitions, 780 flow [2025-02-06 08:59:07,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 280.26666666666665) internal successors, (4204), 15 states have internal predecessors, (4204), 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,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:07,537 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:07,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 08:59:07,742 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:07,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:59:07,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash 837176008, now seen corresponding path program 3 times [2025-02-06 08:59:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250168314] [2025-02-06 08:59:07,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 08:59:07,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:07,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 7 equivalence classes. [2025-02-06 08:59:07,787 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:07,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 08:59:07,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:59:07,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:59:07,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 08:59:07,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 08:59:07,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:07,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:59:07,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:59:07,822 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:59:07,822 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-02-06 08:59:07,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-02-06 08:59:07,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-02-06 08:59:07,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-02-06 08:59:07,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-02-06 08:59:07,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-02-06 08:59:07,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-02-06 08:59:07,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-02-06 08:59:07,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:59:07,824 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-02-06 08:59:07,824 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:59:07,824 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-06 08:59:07,867 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:59:07,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 392 transitions, 824 flow [2025-02-06 08:59:07,932 INFO L124 PetriNetUnfolderBase]: 26/435 cut-off events. [2025-02-06 08:59:07,932 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 08:59:07,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 435 events. 26/435 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1594 event pairs, 0 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 371. Up to 6 conditions per place. [2025-02-06 08:59:07,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 392 transitions, 824 flow [2025-02-06 08:59:07,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 392 transitions, 824 flow [2025-02-06 08:59:07,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:59:07,943 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;@2ad07227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:59:07,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-06 08:59:07,945 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:59:07,945 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-06 08:59:07,946 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:59:07,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:07,946 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:07,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-06 08:59:07,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:07,946 INFO L85 PathProgramCache]: Analyzing trace with hash 684715493, now seen corresponding path program 1 times [2025-02-06 08:59:07,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:07,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000431368] [2025-02-06 08:59:07,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:07,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:07,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 08:59:07,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 08:59:07,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:07,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:08,089 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:08,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000431368] [2025-02-06 08:59:08,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000431368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:59:08,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:59:08,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:59:08,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48683563] [2025-02-06 08:59:08,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:59:08,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:59:08,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:08,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:59:08,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:59:08,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 392 [2025-02-06 08:59:08,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 392 transitions, 824 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 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,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:08,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 392 [2025-02-06 08:59:08,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand