./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:44:01,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:44:01,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:44:01,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:44:01,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:44:01,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:44:01,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:44:01,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:44:01,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:44:01,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:44:01,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:44:01,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:44:01,217 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:44:01,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:44:01,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:44:01,217 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:44:01,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:44:01,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:44:01,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:44:01,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:44:01,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:44:01,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:44:01,218 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:44:01,218 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:44:01,218 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:44:01,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:44:01,218 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:44:01,218 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:44:01,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:44:01,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:44:01,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:44:01,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:44:01,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:44:01,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:44:01,219 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:44:01,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:44:01,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:44:01,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:44:01,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:44:01,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:44:01,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:44:01,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:44:01,220 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-03-17 10:44:01,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:44:01,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:44:01,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:44:01,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:44:01,437 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:44:01,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-17 10:44:02,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b29c089/d1b93c9199664d91b1bc7ee3b6a35024/FLAG4c1b54128 [2025-03-17 10:44:02,870 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:44:02,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-17 10:44:02,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b29c089/d1b93c9199664d91b1bc7ee3b6a35024/FLAG4c1b54128 [2025-03-17 10:44:02,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b29c089/d1b93c9199664d91b1bc7ee3b6a35024 [2025-03-17 10:44:02,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:44:02,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:44:02,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:44:02,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:44:02,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:44:02,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:44:02" (1/1) ... [2025-03-17 10:44:02,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533ddbc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:02, skipping insertion in model container [2025-03-17 10:44:02,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:44:02" (1/1) ... [2025-03-17 10:44:02,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:44:03,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:44:03,179 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:44:03,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:44:03,234 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:44:03,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03 WrapperNode [2025-03-17 10:44:03,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:44:03,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:44:03,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:44:03,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:44:03,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03" (1/1) ... [2025-03-17 10:44:03,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03" (1/1) ... [2025-03-17 10:44:03,262 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 103 [2025-03-17 10:44:03,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:44:03,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:44:03,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:44:03,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:44:03,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03" (1/1) ... [2025-03-17 10:44:03,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03" (1/1) ... [2025-03-17 10:44:03,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03" (1/1) ... [2025-03-17 10:44:03,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03" (1/1) ... [2025-03-17 10:44:03,274 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03" (1/1) ... [2025-03-17 10:44:03,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03" (1/1) ... [2025-03-17 10:44:03,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03" (1/1) ... [2025-03-17 10:44:03,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03" (1/1) ... [2025-03-17 10:44:03,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:44:03,279 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:44:03,279 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:44:03,279 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:44:03,279 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03" (1/1) ... [2025-03-17 10:44:03,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:44:03,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:03,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:44:03,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:44:03,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:44:03,323 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 10:44:03,323 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 10:44:03,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:44:03,323 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 10:44:03,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:44:03,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:44:03,323 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 10:44:03,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:44:03,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:44:03,324 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:44:03,408 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:44:03,410 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:44:03,614 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:44:03,614 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:44:03,637 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:44:03,638 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:44:03,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:44:03 BoogieIcfgContainer [2025-03-17 10:44:03,638 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:44:03,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:44:03,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:44:03,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:44:03,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:44:02" (1/3) ... [2025-03-17 10:44:03,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1076b72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:44:03, skipping insertion in model container [2025-03-17 10:44:03,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:03" (2/3) ... [2025-03-17 10:44:03,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1076b72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:44:03, skipping insertion in model container [2025-03-17 10:44:03,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:44:03" (3/3) ... [2025-03-17 10:44:03,645 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-03-17 10:44:03,654 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:44:03,655 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-03-17 10:44:03,656 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:44:03,720 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:03,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 120 transitions, 244 flow [2025-03-17 10:44:03,805 INFO L124 PetriNetUnfolderBase]: 6/127 cut-off events. [2025-03-17 10:44:03,807 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:03,812 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 137 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-03-17 10:44:03,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 120 transitions, 244 flow [2025-03-17 10:44:03,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 120 transitions, 244 flow [2025-03-17 10:44:03,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:03,832 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;@4fa59d96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:03,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 10:44:03,843 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:03,843 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:44:03,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:03,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:03,844 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-03-17 10:44:03,845 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-03-17 10:44:03,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash 383866432, now seen corresponding path program 1 times [2025-03-17 10:44:03,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:03,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159959333] [2025-03-17 10:44:03,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:03,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:03,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:44:03,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:44:03,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:03,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:04,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159959333] [2025-03-17 10:44:04,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159959333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:04,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:04,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:44:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019152779] [2025-03-17 10:44:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:04,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:44:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:04,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:44:04,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:44:04,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2025-03-17 10:44:04,608 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-03-17 10:44:04,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:04,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2025-03-17 10:44:04,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:04,662 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2025-03-17 10:44:04,663 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:44:04,663 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 80 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-03-17 10:44:04,664 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 15 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-03-17 10:44:04,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 110 transitions, 264 flow [2025-03-17 10:44:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:44:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:44:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2025-03-17 10:44:04,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-03-17 10:44:04,680 INFO L175 Difference]: Start difference. First operand has 117 places, 120 transitions, 244 flow. Second operand 6 states and 583 transitions. [2025-03-17 10:44:04,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 110 transitions, 264 flow [2025-03-17 10:44:04,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 110 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:04,687 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 234 flow [2025-03-17 10:44:04,689 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-03-17 10:44:04,692 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-03-17 10:44:04,694 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 234 flow [2025-03-17 10:44:04,694 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-03-17 10:44:04,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:04,695 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-03-17 10:44:04,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:44:04,695 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-03-17 10:44:04,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:04,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1737443141, now seen corresponding path program 1 times [2025-03-17 10:44:04,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:04,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210796548] [2025-03-17 10:44:04,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:04,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 10:44:04,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 10:44:04,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:04,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:04,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:04,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210796548] [2025-03-17 10:44:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210796548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:04,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:04,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:44:04,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037549714] [2025-03-17 10:44:04,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:04,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:04,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:04,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:04,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:04,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 120 [2025-03-17 10:44:04,755 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-03-17 10:44:04,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:04,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 120 [2025-03-17 10:44:04,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:04,794 INFO L124 PetriNetUnfolderBase]: 3/125 cut-off events. [2025-03-17 10:44:04,794 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 10:44:04,795 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 76 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-03-17 10:44:04,795 INFO L140 encePairwiseOnDemand]: 117/120 looper letters, 9 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-03-17 10:44:04,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 260 flow [2025-03-17 10:44:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-03-17 10:44:04,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9 [2025-03-17 10:44:04,800 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 234 flow. Second operand 3 states and 324 transitions. [2025-03-17 10:44:04,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 260 flow [2025-03-17 10:44:04,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 111 transitions, 248 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:44:04,804 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 236 flow [2025-03-17 10:44:04,804 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-03-17 10:44:04,805 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2025-03-17 10:44:04,805 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 236 flow [2025-03-17 10:44:04,805 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-03-17 10:44:04,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:04,806 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-03-17 10:44:04,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:44:04,806 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-03-17 10:44:04,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1408676174, now seen corresponding path program 1 times [2025-03-17 10:44:04,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:04,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686837924] [2025-03-17 10:44:04,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:04,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:04,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 10:44:04,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 10:44:04,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:04,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:04,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686837924] [2025-03-17 10:44:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686837924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494559858] [2025-03-17 10:44:04,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:04,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:04,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:04,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:44:04,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:44:04,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 10:44:04,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 10:44:04,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:04,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:04,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:44:04,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:05,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:05,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494559858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:05,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:05,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:44:05,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592779697] [2025-03-17 10:44:05,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:05,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:44:05,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:05,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:44:05,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:44:05,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 120 [2025-03-17 10:44:05,190 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-03-17 10:44:05,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:05,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 120 [2025-03-17 10:44:05,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:05,259 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2025-03-17 10:44:05,259 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:44:05,259 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 48 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-03-17 10:44:05,260 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 13 selfloop transitions, 9 changer transitions 0/119 dead transitions. [2025-03-17 10:44:05,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 298 flow [2025-03-17 10:44:05,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:44:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:44:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 933 transitions. [2025-03-17 10:44:05,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8638888888888889 [2025-03-17 10:44:05,262 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 236 flow. Second operand 9 states and 933 transitions. [2025-03-17 10:44:05,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 298 flow [2025-03-17 10:44:05,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 119 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:05,264 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 284 flow [2025-03-17 10:44:05,264 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-03-17 10:44:05,265 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-03-17 10:44:05,265 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 284 flow [2025-03-17 10:44:05,266 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-03-17 10:44:05,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:05,266 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-03-17 10:44:05,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 10:44:05,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:05,467 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-03-17 10:44:05,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash 195567278, now seen corresponding path program 2 times [2025-03-17 10:44:05,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:05,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943988072] [2025-03-17 10:44:05,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:05,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-17 10:44:05,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:44:05,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:05,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:05,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:05,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943988072] [2025-03-17 10:44:05,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943988072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:05,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092714663] [2025-03-17 10:44:05,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:05,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:05,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:05,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:44:05,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:44:05,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-17 10:44:05,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:44:05,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:05,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:05,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:44:05,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:05,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:05,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092714663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:05,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:05,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 10:44:05,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756294339] [2025-03-17 10:44:05,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:05,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 10:44:05,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:05,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 10:44:05,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:44:06,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 120 [2025-03-17 10:44:06,046 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-03-17 10:44:06,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:06,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 120 [2025-03-17 10:44:06,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:06,207 INFO L124 PetriNetUnfolderBase]: 3/179 cut-off events. [2025-03-17 10:44:06,207 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 10:44:06,208 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 49 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-03-17 10:44:06,208 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 16 selfloop transitions, 18 changer transitions 0/131 dead transitions. [2025-03-17 10:44:06,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 131 transitions, 426 flow [2025-03-17 10:44:06,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:44:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 10:44:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1855 transitions. [2025-03-17 10:44:06,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8587962962962963 [2025-03-17 10:44:06,211 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 284 flow. Second operand 18 states and 1855 transitions. [2025-03-17 10:44:06,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 131 transitions, 426 flow [2025-03-17 10:44:06,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 131 transitions, 414 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:06,214 INFO L231 Difference]: Finished difference. Result has 143 places, 127 transitions, 384 flow [2025-03-17 10:44:06,214 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-03-17 10:44:06,215 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2025-03-17 10:44:06,215 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 127 transitions, 384 flow [2025-03-17 10:44:06,216 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-03-17 10:44:06,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:06,216 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-03-17 10:44:06,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 10:44:06,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 10:44:06,421 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-03-17 10:44:06,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:06,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1562587941, now seen corresponding path program 3 times [2025-03-17 10:44:06,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:06,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844963388] [2025-03-17 10:44:06,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:44:06,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:06,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 7 equivalence classes. [2025-03-17 10:44:06,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 10:44:06,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 10:44:06,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:06,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:06,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 10:44:06,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 10:44:06,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:06,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:06,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:06,537 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:06,537 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-17 10:44:06,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-17 10:44:06,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-17 10:44:06,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-17 10:44:06,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-17 10:44:06,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-17 10:44:06,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-17 10:44:06,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-17 10:44:06,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-17 10:44:06,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-17 10:44:06,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:44:06,541 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-17 10:44:06,543 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:06,543 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 10:44:06,574 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:06,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 188 transitions, 386 flow [2025-03-17 10:44:06,590 INFO L124 PetriNetUnfolderBase]: 11/204 cut-off events. [2025-03-17 10:44:06,590 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:44:06,592 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-03-17 10:44:06,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 188 transitions, 386 flow [2025-03-17 10:44:06,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 188 transitions, 386 flow [2025-03-17 10:44:06,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:06,594 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;@4fa59d96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:06,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 10:44:06,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:06,597 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:44:06,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:06,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:06,597 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-03-17 10:44:06,597 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-03-17 10:44:06,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash 866170748, now seen corresponding path program 1 times [2025-03-17 10:44:06,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:06,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956956664] [2025-03-17 10:44:06,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:06,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:44:06,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:44:06,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:06,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:06,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:06,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956956664] [2025-03-17 10:44:06,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956956664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:06,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:06,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:44:06,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693371032] [2025-03-17 10:44:06,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:06,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:44:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:06,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:44:06,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:44:06,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 188 [2025-03-17 10:44:06,878 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-03-17 10:44:06,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:06,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 188 [2025-03-17 10:44:06,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:06,985 INFO L124 PetriNetUnfolderBase]: 104/725 cut-off events. [2025-03-17 10:44:06,985 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 10:44:06,989 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-03-17 10:44:06,991 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 24 selfloop transitions, 5 changer transitions 0/173 dead transitions. [2025-03-17 10:44:06,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 173 transitions, 414 flow [2025-03-17 10:44:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:44:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:44:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 925 transitions. [2025-03-17 10:44:06,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8200354609929078 [2025-03-17 10:44:06,994 INFO L175 Difference]: Start difference. First operand has 182 places, 188 transitions, 386 flow. Second operand 6 states and 925 transitions. [2025-03-17 10:44:06,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 173 transitions, 414 flow [2025-03-17 10:44:06,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 173 transitions, 414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:06,996 INFO L231 Difference]: Finished difference. Result has 178 places, 173 transitions, 366 flow [2025-03-17 10:44:06,996 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-03-17 10:44:06,997 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -4 predicate places. [2025-03-17 10:44:06,997 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 173 transitions, 366 flow [2025-03-17 10:44:06,997 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-03-17 10:44:06,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:06,998 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-03-17 10:44:06,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:44:06,998 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-03-17 10:44:06,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1833094792, now seen corresponding path program 1 times [2025-03-17 10:44:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:06,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586279903] [2025-03-17 10:44:06,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:06,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:07,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 10:44:07,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 10:44:07,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:07,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:07,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:07,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586279903] [2025-03-17 10:44:07,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586279903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:07,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:07,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:44:07,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60148741] [2025-03-17 10:44:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:07,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:07,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:07,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:07,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:07,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 188 [2025-03-17 10:44:07,033 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-03-17 10:44:07,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:07,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 188 [2025-03-17 10:44:07,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:07,102 INFO L124 PetriNetUnfolderBase]: 33/489 cut-off events. [2025-03-17 10:44:07,102 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-17 10:44:07,105 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 2016 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-03-17 10:44:07,106 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2025-03-17 10:44:07,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 174 transitions, 402 flow [2025-03-17 10:44:07,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-03-17 10:44:07,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-03-17 10:44:07,108 INFO L175 Difference]: Start difference. First operand has 178 places, 173 transitions, 366 flow. Second operand 3 states and 506 transitions. [2025-03-17 10:44:07,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 174 transitions, 402 flow [2025-03-17 10:44:07,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 174 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:44:07,112 INFO L231 Difference]: Finished difference. Result has 176 places, 174 transitions, 368 flow [2025-03-17 10:44:07,113 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-03-17 10:44:07,113 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -6 predicate places. [2025-03-17 10:44:07,114 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 174 transitions, 368 flow [2025-03-17 10:44:07,115 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-03-17 10:44:07,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:07,115 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-03-17 10:44:07,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:44:07,115 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-03-17 10:44:07,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:07,116 INFO L85 PathProgramCache]: Analyzing trace with hash 529971837, now seen corresponding path program 1 times [2025-03-17 10:44:07,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:07,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111418084] [2025-03-17 10:44:07,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:07,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 10:44:07,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 10:44:07,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:07,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:07,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:07,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111418084] [2025-03-17 10:44:07,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111418084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:07,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482035829] [2025-03-17 10:44:07,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:07,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:07,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:07,177 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:44:07,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 10:44:07,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 10:44:07,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 10:44:07,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:07,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:07,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:44:07,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:07,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:07,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482035829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:07,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:07,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:44:07,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644607995] [2025-03-17 10:44:07,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:07,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:44:07,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:07,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:44:07,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:44:07,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-17 10:44:07,380 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-03-17 10:44:07,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:07,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-17 10:44:07,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:07,494 INFO L124 PetriNetUnfolderBase]: 33/504 cut-off events. [2025-03-17 10:44:07,494 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 10:44:07,496 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 1987 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-03-17 10:44:07,497 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 18 selfloop transitions, 9 changer transitions 0/182 dead transitions. [2025-03-17 10:44:07,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 182 transitions, 440 flow [2025-03-17 10:44:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:44:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:44:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1469 transitions. [2025-03-17 10:44:07,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682033096926713 [2025-03-17 10:44:07,500 INFO L175 Difference]: Start difference. First operand has 176 places, 174 transitions, 368 flow. Second operand 9 states and 1469 transitions. [2025-03-17 10:44:07,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 182 transitions, 440 flow [2025-03-17 10:44:07,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:07,503 INFO L231 Difference]: Finished difference. Result has 186 places, 180 transitions, 416 flow [2025-03-17 10:44:07,503 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-03-17 10:44:07,504 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-03-17 10:44:07,504 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 180 transitions, 416 flow [2025-03-17 10:44:07,505 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-03-17 10:44:07,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:07,505 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-03-17 10:44:07,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 10:44:07,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:07,706 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-03-17 10:44:07,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1438539357, now seen corresponding path program 2 times [2025-03-17 10:44:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:07,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408705937] [2025-03-17 10:44:07,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:07,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-17 10:44:07,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:44:07,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:07,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 10:44:07,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:07,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408705937] [2025-03-17 10:44:07,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408705937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:07,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213100624] [2025-03-17 10:44:07,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:07,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:07,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:07,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:44:07,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 10:44:07,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-17 10:44:07,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:44:07,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:07,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:07,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:44:07,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 10:44:07,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 10:44:08,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213100624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:08,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:08,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 10:44:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423477294] [2025-03-17 10:44:08,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:08,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 10:44:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:08,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 10:44:08,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:44:08,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-17 10:44:08,168 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-03-17 10:44:08,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:08,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-17 10:44:08,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:08,352 INFO L124 PetriNetUnfolderBase]: 33/543 cut-off events. [2025-03-17 10:44:08,353 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-17 10:44:08,354 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 1977 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-03-17 10:44:08,356 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 21 selfloop transitions, 18 changer transitions 0/194 dead transitions. [2025-03-17 10:44:08,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 194 transitions, 568 flow [2025-03-17 10:44:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:44:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 10:44:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2922 transitions. [2025-03-17 10:44:08,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8634751773049646 [2025-03-17 10:44:08,361 INFO L175 Difference]: Start difference. First operand has 186 places, 180 transitions, 416 flow. Second operand 18 states and 2922 transitions. [2025-03-17 10:44:08,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 194 transitions, 568 flow [2025-03-17 10:44:08,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 194 transitions, 556 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:08,365 INFO L231 Difference]: Finished difference. Result has 206 places, 190 transitions, 516 flow [2025-03-17 10:44:08,365 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-03-17 10:44:08,365 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 24 predicate places. [2025-03-17 10:44:08,366 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 190 transitions, 516 flow [2025-03-17 10:44:08,366 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-03-17 10:44:08,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:08,367 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-03-17 10:44:08,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 10:44:08,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:08,568 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-03-17 10:44:08,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash 919349720, now seen corresponding path program 3 times [2025-03-17 10:44:08,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:08,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472811901] [2025-03-17 10:44:08,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:44:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:08,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-03-17 10:44:08,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 10:44:08,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 10:44:08,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:08,614 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:08,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 10:44:08,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 10:44:08,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:08,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:08,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:08,643 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-17 10:44:08,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-17 10:44:08,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:44:08,643 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-17 10:44:08,644 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:08,644 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 10:44:08,675 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:08,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 256 transitions, 530 flow [2025-03-17 10:44:08,699 INFO L124 PetriNetUnfolderBase]: 16/281 cut-off events. [2025-03-17 10:44:08,699 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:44:08,702 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 767 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-03-17 10:44:08,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 256 transitions, 530 flow [2025-03-17 10:44:08,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 256 transitions, 530 flow [2025-03-17 10:44:08,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:08,706 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;@4fa59d96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:08,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 10:44:08,709 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:08,709 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:44:08,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:08,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:08,709 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-03-17 10:44:08,709 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-03-17 10:44:08,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:08,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1675454340, now seen corresponding path program 1 times [2025-03-17 10:44:08,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:08,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997347954] [2025-03-17 10:44:08,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:08,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:08,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:44:08,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:44:08,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:08,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:08,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997347954] [2025-03-17 10:44:08,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997347954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:08,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:08,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:44:08,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075655664] [2025-03-17 10:44:08,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:08,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:44:08,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:08,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:44:08,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:44:08,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 256 [2025-03-17 10:44:08,993 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-03-17 10:44:08,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:08,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 256 [2025-03-17 10:44:08,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:09,742 INFO L124 PetriNetUnfolderBase]: 1746/6791 cut-off events. [2025-03-17 10:44:09,742 INFO L125 PetriNetUnfolderBase]: For 526/526 co-relation queries the response was YES. [2025-03-17 10:44:09,770 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 66911 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-03-17 10:44:09,811 INFO L140 encePairwiseOnDemand]: 240/256 looper letters, 33 selfloop transitions, 5 changer transitions 0/236 dead transitions. [2025-03-17 10:44:09,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 236 transitions, 566 flow [2025-03-17 10:44:09,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:44:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:44:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1267 transitions. [2025-03-17 10:44:09,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8248697916666666 [2025-03-17 10:44:09,815 INFO L175 Difference]: Start difference. First operand has 247 places, 256 transitions, 530 flow. Second operand 6 states and 1267 transitions. [2025-03-17 10:44:09,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 236 transitions, 566 flow [2025-03-17 10:44:09,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 236 transitions, 564 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:09,819 INFO L231 Difference]: Finished difference. Result has 241 places, 236 transitions, 498 flow [2025-03-17 10:44:09,819 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-03-17 10:44:09,820 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -6 predicate places. [2025-03-17 10:44:09,820 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 236 transitions, 498 flow [2025-03-17 10:44:09,821 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-03-17 10:44:09,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:09,821 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-03-17 10:44:09,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:44:09,821 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-03-17 10:44:09,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:09,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1922294798, now seen corresponding path program 1 times [2025-03-17 10:44:09,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:09,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908778789] [2025-03-17 10:44:09,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:09,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:09,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:44:09,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:44:09,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:09,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:09,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:09,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908778789] [2025-03-17 10:44:09,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908778789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:09,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:09,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:44:09,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688706449] [2025-03-17 10:44:09,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:09,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:09,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:09,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:09,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:09,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 256 [2025-03-17 10:44:09,863 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-03-17 10:44:09,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:09,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 256 [2025-03-17 10:44:09,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:10,115 INFO L124 PetriNetUnfolderBase]: 283/2409 cut-off events. [2025-03-17 10:44:10,116 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-03-17 10:44:10,127 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 19588 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-03-17 10:44:10,136 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 19 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2025-03-17 10:44:10,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 237 transitions, 544 flow [2025-03-17 10:44:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-03-17 10:44:10,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8958333333333334 [2025-03-17 10:44:10,138 INFO L175 Difference]: Start difference. First operand has 241 places, 236 transitions, 498 flow. Second operand 3 states and 688 transitions. [2025-03-17 10:44:10,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 237 transitions, 544 flow [2025-03-17 10:44:10,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 237 transitions, 532 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:44:10,142 INFO L231 Difference]: Finished difference. Result has 239 places, 237 transitions, 500 flow [2025-03-17 10:44:10,142 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-03-17 10:44:10,142 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -8 predicate places. [2025-03-17 10:44:10,142 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 237 transitions, 500 flow [2025-03-17 10:44:10,143 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-03-17 10:44:10,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:10,143 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-03-17 10:44:10,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:44:10,143 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-03-17 10:44:10,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1419185719, now seen corresponding path program 1 times [2025-03-17 10:44:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:10,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543153625] [2025-03-17 10:44:10,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:10,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:10,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 10:44:10,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 10:44:10,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:10,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:10,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:10,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543153625] [2025-03-17 10:44:10,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543153625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:10,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650389296] [2025-03-17 10:44:10,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:10,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:10,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:10,193 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:44:10,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 10:44:10,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 10:44:10,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 10:44:10,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:10,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:10,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:44:10,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:10,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:10,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650389296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:10,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:10,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:44:10,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875539351] [2025-03-17 10:44:10,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:10,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:44:10,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:10,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:44:10,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:44:10,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 256 [2025-03-17 10:44:10,412 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-03-17 10:44:10,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:10,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 256 [2025-03-17 10:44:10,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:10,690 INFO L124 PetriNetUnfolderBase]: 283/2424 cut-off events. [2025-03-17 10:44:10,690 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-03-17 10:44:10,705 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 19686 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-03-17 10:44:10,738 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 23 selfloop transitions, 9 changer transitions 0/245 dead transitions. [2025-03-17 10:44:10,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 245 transitions, 582 flow [2025-03-17 10:44:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:44:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:44:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2005 transitions. [2025-03-17 10:44:10,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702256944444444 [2025-03-17 10:44:10,742 INFO L175 Difference]: Start difference. First operand has 239 places, 237 transitions, 500 flow. Second operand 9 states and 2005 transitions. [2025-03-17 10:44:10,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 245 transitions, 582 flow [2025-03-17 10:44:10,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 245 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:10,746 INFO L231 Difference]: Finished difference. Result has 249 places, 243 transitions, 548 flow [2025-03-17 10:44:10,746 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-03-17 10:44:10,747 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-03-17 10:44:10,747 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 548 flow [2025-03-17 10:44:10,748 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-03-17 10:44:10,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:10,748 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:44:10,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 10:44:10,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 10:44:10,949 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-03-17 10:44:10,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:10,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1718004247, now seen corresponding path program 2 times [2025-03-17 10:44:10,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:10,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443298906] [2025-03-17 10:44:10,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:10,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:10,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-17 10:44:10,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:44:10,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:10,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 10:44:11,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:11,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443298906] [2025-03-17 10:44:11,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443298906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:11,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049343546] [2025-03-17 10:44:11,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:11,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:11,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:11,045 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:44:11,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 10:44:11,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-17 10:44:11,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:44:11,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:11,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:11,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:44:11,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 10:44:11,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 10:44:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049343546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:11,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:11,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 10:44:11,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175003879] [2025-03-17 10:44:11,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:11,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 10:44:11,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:11,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 10:44:11,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:44:11,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 256 [2025-03-17 10:44:11,338 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-03-17 10:44:11,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:11,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 256 [2025-03-17 10:44:11,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:11,755 INFO L124 PetriNetUnfolderBase]: 283/2463 cut-off events. [2025-03-17 10:44:11,755 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-03-17 10:44:11,765 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 19683 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-03-17 10:44:11,772 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 26 selfloop transitions, 18 changer transitions 0/257 dead transitions. [2025-03-17 10:44:11,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 257 transitions, 710 flow [2025-03-17 10:44:11,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:44:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 10:44:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3989 transitions. [2025-03-17 10:44:11,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8656684027777778 [2025-03-17 10:44:11,780 INFO L175 Difference]: Start difference. First operand has 249 places, 243 transitions, 548 flow. Second operand 18 states and 3989 transitions. [2025-03-17 10:44:11,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 257 transitions, 710 flow [2025-03-17 10:44:11,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 257 transitions, 698 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:11,785 INFO L231 Difference]: Finished difference. Result has 269 places, 253 transitions, 648 flow [2025-03-17 10:44:11,787 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-03-17 10:44:11,788 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 22 predicate places. [2025-03-17 10:44:11,788 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 253 transitions, 648 flow [2025-03-17 10:44:11,789 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-03-17 10:44:11,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:11,789 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-03-17 10:44:11,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 10:44:11,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:11,990 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-03-17 10:44:11,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:11,990 INFO L85 PathProgramCache]: Analyzing trace with hash -82039726, now seen corresponding path program 3 times [2025-03-17 10:44:11,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:11,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117217878] [2025-03-17 10:44:11,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:44:11,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:12,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 8 equivalence classes. [2025-03-17 10:44:12,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 10:44:12,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 10:44:12,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:12,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:12,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 10:44:12,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 10:44:12,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:12,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:12,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:12,072 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:12,072 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-17 10:44:12,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-17 10:44:12,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-17 10:44:12,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-17 10:44:12,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-17 10:44:12,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-17 10:44:12,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-17 10:44:12,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-17 10:44:12,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-17 10:44:12,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-17 10:44:12,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-17 10:44:12,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-17 10:44:12,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-17 10:44:12,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-17 10:44:12,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-17 10:44:12,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-17 10:44:12,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-17 10:44:12,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-17 10:44:12,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:44:12,073 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-17 10:44:12,074 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:12,075 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 10:44:12,113 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:12,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 324 transitions, 676 flow [2025-03-17 10:44:12,160 INFO L124 PetriNetUnfolderBase]: 21/358 cut-off events. [2025-03-17 10:44:12,160 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 10:44:12,164 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 8. Compared 1175 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-03-17 10:44:12,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 324 transitions, 676 flow [2025-03-17 10:44:12,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 324 transitions, 676 flow [2025-03-17 10:44:12,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:12,168 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;@4fa59d96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:12,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-17 10:44:12,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:12,172 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:44:12,172 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:12,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:12,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-03-17 10:44:12,172 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-03-17 10:44:12,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1348925760, now seen corresponding path program 1 times [2025-03-17 10:44:12,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:12,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68244763] [2025-03-17 10:44:12,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:12,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:12,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:44:12,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:44:12,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:12,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:12,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:12,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68244763] [2025-03-17 10:44:12,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68244763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:12,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:12,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:44:12,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509741868] [2025-03-17 10:44:12,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:12,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:44:12,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:12,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:44:12,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:44:12,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 324 [2025-03-17 10:44:12,497 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-03-17 10:44:12,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:12,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 324 [2025-03-17 10:44:12,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:19,461 INFO L124 PetriNetUnfolderBase]: 23093/67604 cut-off events. [2025-03-17 10:44:19,461 INFO L125 PetriNetUnfolderBase]: For 7852/7852 co-relation queries the response was YES. [2025-03-17 10:44:19,771 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 896465 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-03-17 10:44:20,151 INFO L140 encePairwiseOnDemand]: 305/324 looper letters, 42 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-03-17 10:44:20,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 720 flow [2025-03-17 10:44:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:44:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:44:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1609 transitions. [2025-03-17 10:44:20,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8276748971193416 [2025-03-17 10:44:20,153 INFO L175 Difference]: Start difference. First operand has 312 places, 324 transitions, 676 flow. Second operand 6 states and 1609 transitions. [2025-03-17 10:44:20,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 720 flow [2025-03-17 10:44:20,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 299 transitions, 714 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:20,161 INFO L231 Difference]: Finished difference. Result has 304 places, 299 transitions, 630 flow [2025-03-17 10:44:20,162 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-03-17 10:44:20,163 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-03-17 10:44:20,163 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 299 transitions, 630 flow [2025-03-17 10:44:20,164 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-03-17 10:44:20,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:20,164 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-03-17 10:44:20,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:44:20,164 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-03-17 10:44:20,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1685099443, now seen corresponding path program 1 times [2025-03-17 10:44:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:20,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759951978] [2025-03-17 10:44:20,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:20,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 10:44:20,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 10:44:20,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:20,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:20,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:20,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759951978] [2025-03-17 10:44:20,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759951978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:20,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:20,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:44:20,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102171559] [2025-03-17 10:44:20,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:20,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:20,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:20,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:20,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:20,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 324 [2025-03-17 10:44:20,200 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-03-17 10:44:20,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:20,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 324 [2025-03-17 10:44:20,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:21,609 INFO L124 PetriNetUnfolderBase]: 2033/12509 cut-off events. [2025-03-17 10:44:21,609 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-17 10:44:21,701 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 147844 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-03-17 10:44:21,776 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 24 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2025-03-17 10:44:21,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 300 transitions, 686 flow [2025-03-17 10:44:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 870 transitions. [2025-03-17 10:44:21,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8950617283950617 [2025-03-17 10:44:21,777 INFO L175 Difference]: Start difference. First operand has 304 places, 299 transitions, 630 flow. Second operand 3 states and 870 transitions. [2025-03-17 10:44:21,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 300 transitions, 686 flow [2025-03-17 10:44:21,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 300 transitions, 674 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:44:21,785 INFO L231 Difference]: Finished difference. Result has 302 places, 300 transitions, 632 flow [2025-03-17 10:44:21,785 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-03-17 10:44:21,785 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-03-17 10:44:21,786 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 300 transitions, 632 flow [2025-03-17 10:44:21,786 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-03-17 10:44:21,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:21,786 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-03-17 10:44:21,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:44:21,786 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-03-17 10:44:21,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:21,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1519890556, now seen corresponding path program 1 times [2025-03-17 10:44:21,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:21,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178728321] [2025-03-17 10:44:21,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:21,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:21,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:44:21,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:44:21,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:21,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:21,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:21,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178728321] [2025-03-17 10:44:21,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178728321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:21,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366807437] [2025-03-17 10:44:21,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:21,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:21,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:21,837 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:44:21,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 10:44:21,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:44:21,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:44:21,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:21,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:21,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:44:21,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:22,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:22,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366807437] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:22,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:22,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:44:22,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474190651] [2025-03-17 10:44:22,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:22,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:44:22,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:22,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:44:22,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:44:22,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 324 [2025-03-17 10:44:22,098 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-03-17 10:44:22,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:22,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 324 [2025-03-17 10:44:22,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:23,612 INFO L124 PetriNetUnfolderBase]: 2033/12524 cut-off events. [2025-03-17 10:44:23,612 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2025-03-17 10:44:23,713 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 147314 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-03-17 10:44:23,786 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 28 selfloop transitions, 9 changer transitions 0/308 dead transitions. [2025-03-17 10:44:23,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 308 transitions, 724 flow [2025-03-17 10:44:23,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:44:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:44:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2541 transitions. [2025-03-17 10:44:23,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8713991769547325 [2025-03-17 10:44:23,789 INFO L175 Difference]: Start difference. First operand has 302 places, 300 transitions, 632 flow. Second operand 9 states and 2541 transitions. [2025-03-17 10:44:23,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 308 transitions, 724 flow [2025-03-17 10:44:23,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 308 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:23,797 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 680 flow [2025-03-17 10:44:23,798 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-03-17 10:44:23,798 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 0 predicate places. [2025-03-17 10:44:23,798 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 680 flow [2025-03-17 10:44:23,799 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-03-17 10:44:23,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:23,800 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-03-17 10:44:23,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 10:44:24,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:24,004 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-03-17 10:44:24,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:24,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1457759708, now seen corresponding path program 2 times [2025-03-17 10:44:24,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:24,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837191350] [2025-03-17 10:44:24,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:24,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:24,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-17 10:44:24,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 10:44:24,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:24,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 10:44:24,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:24,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837191350] [2025-03-17 10:44:24,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837191350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:24,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153757269] [2025-03-17 10:44:24,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:24,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:24,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:24,125 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:44:24,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 10:44:24,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-17 10:44:24,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 10:44:24,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:24,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:24,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:44:24,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 10:44:24,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 10:44:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153757269] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:24,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 10:44:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344982443] [2025-03-17 10:44:24,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:24,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 10:44:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:24,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 10:44:24,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:44:24,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 324 [2025-03-17 10:44:24,466 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-03-17 10:44:24,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:24,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 324 [2025-03-17 10:44:24,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:26,578 INFO L124 PetriNetUnfolderBase]: 2033/12563 cut-off events. [2025-03-17 10:44:26,578 INFO L125 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2025-03-17 10:44:26,648 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 147784 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-03-17 10:44:26,702 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 31 selfloop transitions, 18 changer transitions 0/320 dead transitions. [2025-03-17 10:44:26,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 320 transitions, 852 flow [2025-03-17 10:44:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:44:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 10:44:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5056 transitions. [2025-03-17 10:44:26,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8669410150891632 [2025-03-17 10:44:26,707 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 680 flow. Second operand 18 states and 5056 transitions. [2025-03-17 10:44:26,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 320 transitions, 852 flow [2025-03-17 10:44:26,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 320 transitions, 840 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:26,715 INFO L231 Difference]: Finished difference. Result has 332 places, 316 transitions, 780 flow [2025-03-17 10:44:26,715 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-03-17 10:44:26,715 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 20 predicate places. [2025-03-17 10:44:26,716 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 316 transitions, 780 flow [2025-03-17 10:44:26,717 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-03-17 10:44:26,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:26,717 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-03-17 10:44:26,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 10:44:26,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:26,918 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-03-17 10:44:26,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:26,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1741416339, now seen corresponding path program 3 times [2025-03-17 10:44:26,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:26,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983646096] [2025-03-17 10:44:26,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:44:26,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:26,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 8 equivalence classes. [2025-03-17 10:44:26,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 10:44:26,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 10:44:26,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:26,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:26,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 10:44:26,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 10:44:26,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:26,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:26,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:26,992 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:26,992 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-17 10:44:26,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-17 10:44:26,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-17 10:44:26,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-17 10:44:26,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-17 10:44:26,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-17 10:44:26,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-17 10:44:26,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-17 10:44:26,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 10:44:26,994 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-17 10:44:26,994 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:26,994 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-17 10:44:27,038 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:27,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 392 transitions, 824 flow [2025-03-17 10:44:27,102 INFO L124 PetriNetUnfolderBase]: 26/435 cut-off events. [2025-03-17 10:44:27,102 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 10:44:27,107 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 1598 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-03-17 10:44:27,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 392 transitions, 824 flow [2025-03-17 10:44:27,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 392 transitions, 824 flow [2025-03-17 10:44:27,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:27,112 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;@4fa59d96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:27,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-17 10:44:27,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:27,115 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:44:27,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:27,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:27,116 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-03-17 10:44:27,116 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-03-17 10:44:27,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1349376456, now seen corresponding path program 1 times [2025-03-17 10:44:27,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:27,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877737155] [2025-03-17 10:44:27,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:27,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:27,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:44:27,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:44:27,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:27,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:27,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877737155] [2025-03-17 10:44:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877737155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:27,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:27,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:44:27,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788248197] [2025-03-17 10:44:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:27,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:44:27,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:27,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:44:27,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:44:27,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 392 [2025-03-17 10:44:27,472 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-03-17 10:44:27,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:27,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 392 [2025-03-17 10:44:27,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand