./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.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 ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:17:54,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:17:54,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:17:54,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:17:54,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:17:54,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:17:54,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:17:54,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:17:54,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:17:54,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:17:54,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:17:54,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:17:54,848 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:17:54,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:17:54,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:17:54,848 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:17:54,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:17:54,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:17:54,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:17:54,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:17:54,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:17:54,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:17:54,851 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:17:54,851 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:17:54,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:17:54,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:17:54,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:17:54,851 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:17:54,851 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:17:54,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:17:54,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:17:54,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:17:54,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:17:54,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:17:54,852 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:17:54,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:17:54,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:17:54,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:17:54,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:17:54,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:17:54,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:17:54,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:17:54,852 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-03-14 01:17:55,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:17:55,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:17:55,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:17:55,116 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:17:55,116 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:17:55,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-14 01:17:56,322 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aaeb36a6/2551f3297b0c4946883cd6b9b5f23610/FLAGf394db6d8 [2025-03-14 01:17:56,623 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:17:56,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-14 01:17:56,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aaeb36a6/2551f3297b0c4946883cd6b9b5f23610/FLAGf394db6d8 [2025-03-14 01:17:56,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aaeb36a6/2551f3297b0c4946883cd6b9b5f23610 [2025-03-14 01:17:56,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:17:56,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:17:56,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:17:56,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:17:56,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:17:56,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:17:56" (1/1) ... [2025-03-14 01:17:56,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7783aab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:56, skipping insertion in model container [2025-03-14 01:17:56,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:17:56" (1/1) ... [2025-03-14 01:17:56,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:17:57,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:17:57,194 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:17:57,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:17:57,254 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:17:57,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57 WrapperNode [2025-03-14 01:17:57,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:17:57,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:17:57,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:17:57,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:17:57,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57" (1/1) ... [2025-03-14 01:17:57,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57" (1/1) ... [2025-03-14 01:17:57,287 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 108 [2025-03-14 01:17:57,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:17:57,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:17:57,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:17:57,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:17:57,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57" (1/1) ... [2025-03-14 01:17:57,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57" (1/1) ... [2025-03-14 01:17:57,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57" (1/1) ... [2025-03-14 01:17:57,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57" (1/1) ... [2025-03-14 01:17:57,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57" (1/1) ... [2025-03-14 01:17:57,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57" (1/1) ... [2025-03-14 01:17:57,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57" (1/1) ... [2025-03-14 01:17:57,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57" (1/1) ... [2025-03-14 01:17:57,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:17:57,313 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:17:57,314 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:17:57,314 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:17:57,315 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57" (1/1) ... [2025-03-14 01:17:57,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:17:57,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:57,346 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-14 01:17:57,355 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-14 01:17:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:17:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 01:17:57,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 01:17:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:17:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:17:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:17:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:17:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:17:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:17:57,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:17:57,371 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:17:57,478 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:17:57,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:17:57,688 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:17:57,689 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:17:57,689 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:17:57,708 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:17:57,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:17:57 BoogieIcfgContainer [2025-03-14 01:17:57,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:17:57,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:17:57,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:17:57,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:17:57,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:17:56" (1/3) ... [2025-03-14 01:17:57,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aab1db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:17:57, skipping insertion in model container [2025-03-14 01:17:57,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:57" (2/3) ... [2025-03-14 01:17:57,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aab1db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:17:57, skipping insertion in model container [2025-03-14 01:17:57,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:17:57" (3/3) ... [2025-03-14 01:17:57,716 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-03-14 01:17:57,730 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:17:57,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 118 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-03-14 01:17:57,732 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:17:57,807 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:57,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 126 transitions, 256 flow [2025-03-14 01:17:57,877 INFO L124 PetriNetUnfolderBase]: 8/133 cut-off events. [2025-03-14 01:17:57,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:57,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 133 events. 8/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 185 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2025-03-14 01:17:57,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 126 transitions, 256 flow [2025-03-14 01:17:57,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 126 transitions, 256 flow [2025-03-14 01:17:57,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:57,904 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;@40a109e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:57,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-14 01:17:57,922 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:57,924 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:17:57,924 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:57,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:57,925 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-14 01:17:57,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:57,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:57,929 INFO L85 PathProgramCache]: Analyzing trace with hash 783243572, now seen corresponding path program 1 times [2025-03-14 01:17:57,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:57,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988498111] [2025-03-14 01:17:57,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:57,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:58,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:17:58,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:17:58,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:58,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:58,632 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-14 01:17:58,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:58,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988498111] [2025-03-14 01:17:58,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988498111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:58,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:58,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:17:58,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288968704] [2025-03-14 01:17:58,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:58,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:17:58,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:58,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:17:58,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:17:58,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 126 [2025-03-14 01:17:58,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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-14 01:17:58,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:58,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 126 [2025-03-14 01:17:58,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:58,909 INFO L124 PetriNetUnfolderBase]: 5/119 cut-off events. [2025-03-14 01:17:58,909 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:17:58,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 119 events. 5/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs, 0 based on Foata normal form. 13/121 useless extension candidates. Maximal degree in co-relation 81. Up to 16 conditions per place. [2025-03-14 01:17:58,911 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 15 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2025-03-14 01:17:58,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 116 transitions, 276 flow [2025-03-14 01:17:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:17:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:17:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2025-03-14 01:17:58,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8187830687830688 [2025-03-14 01:17:58,927 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 256 flow. Second operand 6 states and 619 transitions. [2025-03-14 01:17:58,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 116 transitions, 276 flow [2025-03-14 01:17:58,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:58,936 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 246 flow [2025-03-14 01:17:58,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=119, PETRI_TRANSITIONS=116} [2025-03-14 01:17:58,941 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -2 predicate places. [2025-03-14 01:17:58,941 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 246 flow [2025-03-14 01:17:58,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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-14 01:17:58,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:58,943 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-14 01:17:58,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:17:58,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:58,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1601911108, now seen corresponding path program 1 times [2025-03-14 01:17:58,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:58,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711337571] [2025-03-14 01:17:58,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:58,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:17:58,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:17:58,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:58,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:58,994 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-14 01:17:58,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:58,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711337571] [2025-03-14 01:17:58,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711337571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:58,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:58,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:17:58,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601699601] [2025-03-14 01:17:58,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:58,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:17:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:58,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:17:58,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:17:59,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 126 [2025-03-14 01:17:59,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-14 01:17:59,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:59,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 126 [2025-03-14 01:17:59,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:59,060 INFO L124 PetriNetUnfolderBase]: 5/131 cut-off events. [2025-03-14 01:17:59,060 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:17:59,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 131 events. 5/131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 128 event pairs, 0 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 96. Up to 11 conditions per place. [2025-03-14 01:17:59,061 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 9 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-03-14 01:17:59,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 272 flow [2025-03-14 01:17:59,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:17:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:17:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-03-14 01:17:59,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-14 01:17:59,062 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 246 flow. Second operand 3 states and 342 transitions. [2025-03-14 01:17:59,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 272 flow [2025-03-14 01:17:59,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:17:59,066 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 248 flow [2025-03-14 01:17:59,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2025-03-14 01:17:59,066 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -4 predicate places. [2025-03-14 01:17:59,066 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 248 flow [2025-03-14 01:17:59,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-14 01:17:59,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:59,067 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-14 01:17:59,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:17:59,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:59,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:59,068 INFO L85 PathProgramCache]: Analyzing trace with hash 906211406, now seen corresponding path program 1 times [2025-03-14 01:17:59,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:59,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923804546] [2025-03-14 01:17:59,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:59,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:59,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-14 01:17:59,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-14 01:17:59,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:59,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:59,164 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-14 01:17:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923804546] [2025-03-14 01:17:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923804546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640550754] [2025-03-14 01:17:59,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:59,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:59,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:59,170 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-14 01:17:59,171 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-14 01:17:59,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-14 01:17:59,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-14 01:17:59,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:59,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:59,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:17:59,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:59,279 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-14 01:17:59,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:59,329 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-14 01:17:59,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640550754] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:59,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:59,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:17:59,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670834689] [2025-03-14 01:17:59,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:59,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:17:59,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:59,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:17:59,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:17:59,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 126 [2025-03-14 01:17:59,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 248 flow. Second operand has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 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-14 01:17:59,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:59,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 126 [2025-03-14 01:17:59,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:59,523 INFO L124 PetriNetUnfolderBase]: 5/146 cut-off events. [2025-03-14 01:17:59,525 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:17:59,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 146 events. 5/146 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 131. Up to 11 conditions per place. [2025-03-14 01:17:59,526 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 13 selfloop transitions, 9 changer transitions 0/125 dead transitions. [2025-03-14 01:17:59,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 125 transitions, 310 flow [2025-03-14 01:17:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:17:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:17:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 987 transitions. [2025-03-14 01:17:59,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2025-03-14 01:17:59,531 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 248 flow. Second operand 9 states and 987 transitions. [2025-03-14 01:17:59,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 125 transitions, 310 flow [2025-03-14 01:17:59,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 125 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:59,533 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 296 flow [2025-03-14 01:17:59,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2025-03-14 01:17:59,534 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 6 predicate places. [2025-03-14 01:17:59,534 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 296 flow [2025-03-14 01:17:59,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 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-14 01:17:59,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:59,535 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-14 01:17:59,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:17:59,736 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-14 01:17:59,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:59,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1229087986, now seen corresponding path program 2 times [2025-03-14 01:17:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:59,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826803864] [2025-03-14 01:17:59,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:59,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:59,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-14 01:17:59,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-14 01:17:59,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:59,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-14 01:17:59,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:59,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826803864] [2025-03-14 01:17:59,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826803864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:59,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086179396] [2025-03-14 01:17:59,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:59,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:59,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:59,951 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-14 01:17:59,953 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-14 01:18:00,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-14 01:18:00,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-14 01:18:00,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:18:00,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:00,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:18:00,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-14 01:18:00,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:18:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-14 01:18:00,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086179396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:18:00,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:18:00,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:18:00,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113866299] [2025-03-14 01:18:00,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:18:00,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:18:00,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:00,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:18:00,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:18:00,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 126 [2025-03-14 01:18:00,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 296 flow. Second operand has 15 states, 15 states have (on average 109.06666666666666) internal successors, (1636), 15 states have internal predecessors, (1636), 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-14 01:18:00,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:00,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 126 [2025-03-14 01:18:00,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:00,500 INFO L124 PetriNetUnfolderBase]: 5/185 cut-off events. [2025-03-14 01:18:00,501 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:18:00,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 185 events. 5/185 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 3/178 useless extension candidates. Maximal degree in co-relation 185. Up to 11 conditions per place. [2025-03-14 01:18:00,502 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 16 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2025-03-14 01:18:00,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 438 flow [2025-03-14 01:18:00,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:18:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:18:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1963 transitions. [2025-03-14 01:18:00,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8655202821869489 [2025-03-14 01:18:00,506 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 296 flow. Second operand 18 states and 1963 transitions. [2025-03-14 01:18:00,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 438 flow [2025-03-14 01:18:00,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 137 transitions, 426 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:00,513 INFO L231 Difference]: Finished difference. Result has 147 places, 133 transitions, 396 flow [2025-03-14 01:18:00,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=396, PETRI_PLACES=147, PETRI_TRANSITIONS=133} [2025-03-14 01:18:00,514 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 26 predicate places. [2025-03-14 01:18:00,514 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 133 transitions, 396 flow [2025-03-14 01:18:00,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 109.06666666666666) internal successors, (1636), 15 states have internal predecessors, (1636), 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-14 01:18:00,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:00,515 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-14 01:18:00,522 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-14 01:18:00,720 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-14 01:18:00,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:18:00,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:00,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1150643836, now seen corresponding path program 3 times [2025-03-14 01:18:00,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:00,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452408028] [2025-03-14 01:18:00,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:18:00,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:00,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 8 equivalence classes. [2025-03-14 01:18:00,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 116 of 116 statements. [2025-03-14 01:18:00,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-14 01:18:00,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:18:00,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:18:00,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-14 01:18:00,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-14 01:18:00,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:00,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:18:00,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:18:00,833 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:18:00,834 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-14 01:18:00,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-14 01:18:00,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-14 01:18:00,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-14 01:18:00,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-14 01:18:00,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-14 01:18:00,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-14 01:18:00,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-14 01:18:00,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-14 01:18:00,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-14 01:18:00,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:18:00,837 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-14 01:18:00,838 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:18:00,839 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:18:00,873 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:18:00,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 200 transitions, 410 flow [2025-03-14 01:18:00,909 INFO L124 PetriNetUnfolderBase]: 15/216 cut-off events. [2025-03-14 01:18:00,909 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:18:00,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 216 events. 15/216 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 531 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2025-03-14 01:18:00,911 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 200 transitions, 410 flow [2025-03-14 01:18:00,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 200 transitions, 410 flow [2025-03-14 01:18:00,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:18:00,914 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;@40a109e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:18:00,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-14 01:18:00,916 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:18:00,917 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:18:00,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:18:00,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:00,917 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-14 01:18:00,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:18:00,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash -531312388, now seen corresponding path program 1 times [2025-03-14 01:18:00,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:00,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712451400] [2025-03-14 01:18:00,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:00,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:18:00,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:18:00,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:00,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:01,077 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-14 01:18:01,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:01,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712451400] [2025-03-14 01:18:01,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712451400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:01,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:18:01,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:18:01,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411300258] [2025-03-14 01:18:01,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:01,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:18:01,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:01,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:18:01,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:18:01,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 200 [2025-03-14 01:18:01,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 200 transitions, 410 flow. Second operand has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 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-14 01:18:01,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:01,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 200 [2025-03-14 01:18:01,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:01,323 INFO L124 PetriNetUnfolderBase]: 134/844 cut-off events. [2025-03-14 01:18:01,323 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-14 01:18:01,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 844 events. 134/844 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5311 event pairs, 72 based on Foata normal form. 137/853 useless extension candidates. Maximal degree in co-relation 384. Up to 193 conditions per place. [2025-03-14 01:18:01,334 INFO L140 encePairwiseOnDemand]: 187/200 looper letters, 24 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2025-03-14 01:18:01,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 185 transitions, 438 flow [2025-03-14 01:18:01,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:18:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:18:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 997 transitions. [2025-03-14 01:18:01,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8308333333333333 [2025-03-14 01:18:01,337 INFO L175 Difference]: Start difference. First operand has 190 places, 200 transitions, 410 flow. Second operand 6 states and 997 transitions. [2025-03-14 01:18:01,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 185 transitions, 438 flow [2025-03-14 01:18:01,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 185 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:18:01,341 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 390 flow [2025-03-14 01:18:01,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-03-14 01:18:01,343 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, -4 predicate places. [2025-03-14 01:18:01,344 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 390 flow [2025-03-14 01:18:01,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 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-14 01:18:01,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:01,344 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-14 01:18:01,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:18:01,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:18:01,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:01,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1086610975, now seen corresponding path program 1 times [2025-03-14 01:18:01,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:01,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054313265] [2025-03-14 01:18:01,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:01,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:01,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-14 01:18:01,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-14 01:18:01,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:01,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:01,375 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-14 01:18:01,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:01,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054313265] [2025-03-14 01:18:01,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054313265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:01,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:18:01,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:18:01,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831466339] [2025-03-14 01:18:01,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:01,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:18:01,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:01,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:18:01,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:18:01,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2025-03-14 01:18:01,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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-14 01:18:01,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:01,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2025-03-14 01:18:01,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:01,459 INFO L124 PetriNetUnfolderBase]: 45/525 cut-off events. [2025-03-14 01:18:01,459 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-14 01:18:01,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 525 events. 45/525 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2385 event pairs, 20 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 550. Up to 56 conditions per place. [2025-03-14 01:18:01,463 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 14 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2025-03-14 01:18:01,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 186 transitions, 426 flow [2025-03-14 01:18:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:18:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:18:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2025-03-14 01:18:01,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9033333333333333 [2025-03-14 01:18:01,464 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 390 flow. Second operand 3 states and 542 transitions. [2025-03-14 01:18:01,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 186 transitions, 426 flow [2025-03-14 01:18:01,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 186 transitions, 414 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:18:01,468 INFO L231 Difference]: Finished difference. Result has 184 places, 186 transitions, 392 flow [2025-03-14 01:18:01,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=184, PETRI_TRANSITIONS=186} [2025-03-14 01:18:01,471 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, -6 predicate places. [2025-03-14 01:18:01,471 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 186 transitions, 392 flow [2025-03-14 01:18:01,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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-14 01:18:01,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:01,471 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-14 01:18:01,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:18:01,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:18:01,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:01,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1869771963, now seen corresponding path program 1 times [2025-03-14 01:18:01,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:01,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102187718] [2025-03-14 01:18:01,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:01,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:01,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:18:01,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:18:01,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:01,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:01,529 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-14 01:18:01,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:01,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102187718] [2025-03-14 01:18:01,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102187718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:18:01,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453746366] [2025-03-14 01:18:01,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:01,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:01,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:18:01,533 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-14 01:18:01,535 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-14 01:18:01,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:18:01,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:18:01,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:01,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:01,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:18:01,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:01,630 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-14 01:18:01,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:18:01,667 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-14 01:18:01,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453746366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:18:01,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:18:01,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:18:01,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329774940] [2025-03-14 01:18:01,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:18:01,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:18:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:01,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:18:01,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:18:01,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 200 [2025-03-14 01:18:01,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 186 transitions, 392 flow. Second operand has 10 states, 10 states have (on average 174.0) internal successors, (1740), 10 states have internal predecessors, (1740), 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-14 01:18:01,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:01,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 200 [2025-03-14 01:18:01,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:01,843 INFO L124 PetriNetUnfolderBase]: 45/540 cut-off events. [2025-03-14 01:18:01,843 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-14 01:18:01,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 540 events. 45/540 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2356 event pairs, 20 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 585. Up to 56 conditions per place. [2025-03-14 01:18:01,848 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 18 selfloop transitions, 9 changer transitions 0/194 dead transitions. [2025-03-14 01:18:01,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 194 transitions, 464 flow [2025-03-14 01:18:01,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:18:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:18:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1577 transitions. [2025-03-14 01:18:01,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761111111111111 [2025-03-14 01:18:01,851 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 392 flow. Second operand 9 states and 1577 transitions. [2025-03-14 01:18:01,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 194 transitions, 464 flow [2025-03-14 01:18:01,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 194 transitions, 462 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:01,854 INFO L231 Difference]: Finished difference. Result has 194 places, 192 transitions, 440 flow [2025-03-14 01:18:01,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=440, PETRI_PLACES=194, PETRI_TRANSITIONS=192} [2025-03-14 01:18:01,855 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 4 predicate places. [2025-03-14 01:18:01,855 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 192 transitions, 440 flow [2025-03-14 01:18:01,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 174.0) internal successors, (1740), 10 states have internal predecessors, (1740), 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-14 01:18:01,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:01,857 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-14 01:18:01,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:18:02,061 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-14 01:18:02,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:18:02,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash 347810427, now seen corresponding path program 2 times [2025-03-14 01:18:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:02,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014114094] [2025-03-14 01:18:02,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:18:02,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:02,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-14 01:18:02,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:18:02,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:18:02,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-14 01:18:02,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:02,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014114094] [2025-03-14 01:18:02,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014114094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:18:02,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230501437] [2025-03-14 01:18:02,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:18:02,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:02,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:18:02,209 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-14 01:18:02,211 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-14 01:18:02,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-14 01:18:02,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:18:02,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:18:02,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:02,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:18:02,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-14 01:18:02,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:18:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-14 01:18:02,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230501437] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:18:02,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:18:02,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:18:02,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078910907] [2025-03-14 01:18:02,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:18:02,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:18:02,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:02,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:18:02,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:18:02,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 200 [2025-03-14 01:18:02,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 192 transitions, 440 flow. Second operand has 15 states, 15 states have (on average 174.13333333333333) internal successors, (2612), 15 states have internal predecessors, (2612), 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-14 01:18:02,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:02,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 200 [2025-03-14 01:18:02,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:02,759 INFO L124 PetriNetUnfolderBase]: 45/579 cut-off events. [2025-03-14 01:18:02,759 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-14 01:18:02,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 579 events. 45/579 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2331 event pairs, 20 based on Foata normal form. 3/521 useless extension candidates. Maximal degree in co-relation 547. Up to 56 conditions per place. [2025-03-14 01:18:02,763 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 21 selfloop transitions, 18 changer transitions 0/206 dead transitions. [2025-03-14 01:18:02,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 592 flow [2025-03-14 01:18:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:18:02,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:18:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3138 transitions. [2025-03-14 01:18:02,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8716666666666667 [2025-03-14 01:18:02,769 INFO L175 Difference]: Start difference. First operand has 194 places, 192 transitions, 440 flow. Second operand 18 states and 3138 transitions. [2025-03-14 01:18:02,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 592 flow [2025-03-14 01:18:02,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 206 transitions, 580 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:02,773 INFO L231 Difference]: Finished difference. Result has 214 places, 202 transitions, 540 flow [2025-03-14 01:18:02,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=540, PETRI_PLACES=214, PETRI_TRANSITIONS=202} [2025-03-14 01:18:02,774 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 24 predicate places. [2025-03-14 01:18:02,774 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 202 transitions, 540 flow [2025-03-14 01:18:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 174.13333333333333) internal successors, (2612), 15 states have internal predecessors, (2612), 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-14 01:18:02,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:02,775 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-14 01:18:02,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:18:02,979 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-14 01:18:02,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:18:02,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash -296384351, now seen corresponding path program 3 times [2025-03-14 01:18:02,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:02,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811888453] [2025-03-14 01:18:02,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:18:02,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:03,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-03-14 01:18:03,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 122 of 122 statements. [2025-03-14 01:18:03,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-14 01:18:03,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:18:03,037 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:18:03,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-14 01:18:03,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-14 01:18:03,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:03,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:18:03,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:18:03,074 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:18:03,074 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-14 01:18:03,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-14 01:18:03,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-14 01:18:03,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-14 01:18:03,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-14 01:18:03,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-14 01:18:03,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-14 01:18:03,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-14 01:18:03,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-14 01:18:03,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-14 01:18:03,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-14 01:18:03,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-14 01:18:03,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-14 01:18:03,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-14 01:18:03,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:18:03,076 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-14 01:18:03,076 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:18:03,077 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:18:03,118 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:18:03,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 274 transitions, 566 flow [2025-03-14 01:18:03,143 INFO L124 PetriNetUnfolderBase]: 22/299 cut-off events. [2025-03-14 01:18:03,143 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:18:03,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 299 events. 22/299 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 964 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 228. Up to 4 conditions per place. [2025-03-14 01:18:03,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 274 transitions, 566 flow [2025-03-14 01:18:03,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 274 transitions, 566 flow [2025-03-14 01:18:03,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:18:03,150 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;@40a109e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:18:03,150 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-14 01:18:03,153 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:18:03,153 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:18:03,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:18:03,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:03,154 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-14 01:18:03,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:18:03,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:03,154 INFO L85 PathProgramCache]: Analyzing trace with hash 674223054, now seen corresponding path program 1 times [2025-03-14 01:18:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:03,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216603976] [2025-03-14 01:18:03,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:03,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:03,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:18:03,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:18:03,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:03,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:03,327 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-14 01:18:03,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:03,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216603976] [2025-03-14 01:18:03,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216603976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:03,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:18:03,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:18:03,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818781608] [2025-03-14 01:18:03,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:03,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:18:03,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:03,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:18:03,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:18:03,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 274 [2025-03-14 01:18:03,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 274 transitions, 566 flow. Second operand has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 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-14 01:18:03,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:03,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 274 [2025-03-14 01:18:03,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:04,236 INFO L124 PetriNetUnfolderBase]: 2123/7948 cut-off events. [2025-03-14 01:18:04,236 INFO L125 PetriNetUnfolderBase]: For 622/622 co-relation queries the response was YES. [2025-03-14 01:18:04,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10942 conditions, 7948 events. 2123/7948 cut-off events. For 622/622 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 85146 event pairs, 1368 based on Foata normal form. 1386/7953 useless extension candidates. Maximal degree in co-relation 1866. Up to 2632 conditions per place. [2025-03-14 01:18:04,299 INFO L140 encePairwiseOnDemand]: 258/274 looper letters, 33 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2025-03-14 01:18:04,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 254 transitions, 602 flow [2025-03-14 01:18:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:18:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:18:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1375 transitions. [2025-03-14 01:18:04,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8363746958637469 [2025-03-14 01:18:04,302 INFO L175 Difference]: Start difference. First operand has 259 places, 274 transitions, 566 flow. Second operand 6 states and 1375 transitions. [2025-03-14 01:18:04,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 254 transitions, 602 flow [2025-03-14 01:18:04,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 600 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 01:18:04,306 INFO L231 Difference]: Finished difference. Result has 253 places, 254 transitions, 534 flow [2025-03-14 01:18:04,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=253, PETRI_TRANSITIONS=254} [2025-03-14 01:18:04,307 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -6 predicate places. [2025-03-14 01:18:04,307 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 254 transitions, 534 flow [2025-03-14 01:18:04,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 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-14 01:18:04,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:04,307 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-14 01:18:04,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:18:04,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:18:04,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:04,308 INFO L85 PathProgramCache]: Analyzing trace with hash -978672103, now seen corresponding path program 1 times [2025-03-14 01:18:04,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:04,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96072195] [2025-03-14 01:18:04,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:04,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:04,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:18:04,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:18:04,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:04,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:04,328 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-14 01:18:04,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96072195] [2025-03-14 01:18:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96072195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:18:04,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:18:04,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612759210] [2025-03-14 01:18:04,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:04,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:18:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:04,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:18:04,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:18:04,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 274 [2025-03-14 01:18:04,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 254 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-14 01:18:04,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:04,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 274 [2025-03-14 01:18:04,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:04,634 INFO L124 PetriNetUnfolderBase]: 345/2595 cut-off events. [2025-03-14 01:18:04,635 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-03-14 01:18:04,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 2595 events. 345/2595 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 22039 event pairs, 220 based on Foata normal form. 1/2279 useless extension candidates. Maximal degree in co-relation 3020. Up to 381 conditions per place. [2025-03-14 01:18:04,653 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 19 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2025-03-14 01:18:04,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 255 transitions, 580 flow [2025-03-14 01:18:04,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:18:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:18:04,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-03-14 01:18:04,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.902676399026764 [2025-03-14 01:18:04,655 INFO L175 Difference]: Start difference. First operand has 253 places, 254 transitions, 534 flow. Second operand 3 states and 742 transitions. [2025-03-14 01:18:04,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 255 transitions, 580 flow [2025-03-14 01:18:04,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 255 transitions, 568 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:18:04,658 INFO L231 Difference]: Finished difference. Result has 251 places, 255 transitions, 536 flow [2025-03-14 01:18:04,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=251, PETRI_TRANSITIONS=255} [2025-03-14 01:18:04,659 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -8 predicate places. [2025-03-14 01:18:04,659 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 255 transitions, 536 flow [2025-03-14 01:18:04,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-14 01:18:04,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:04,660 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-14 01:18:04,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:18:04,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:18:04,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:04,661 INFO L85 PathProgramCache]: Analyzing trace with hash 714799237, now seen corresponding path program 1 times [2025-03-14 01:18:04,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:04,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451753981] [2025-03-14 01:18:04,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:04,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:04,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:18:04,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:18:04,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:04,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:04,716 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-14 01:18:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:04,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451753981] [2025-03-14 01:18:04,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451753981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:18:04,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169968780] [2025-03-14 01:18:04,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:04,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:04,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:18:04,719 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-14 01:18:04,721 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-14 01:18:04,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:18:04,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:18:04,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:04,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:04,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:18:04,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:04,826 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-14 01:18:04,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:18:04,859 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-14 01:18:04,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169968780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:18:04,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:18:04,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:18:04,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651251961] [2025-03-14 01:18:04,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:18:04,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:18:04,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:04,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:18:04,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:18:04,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 274 [2025-03-14 01:18:04,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 255 transitions, 536 flow. Second operand has 10 states, 10 states have (on average 239.1) internal successors, (2391), 10 states have internal predecessors, (2391), 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-14 01:18:04,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:04,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 274 [2025-03-14 01:18:04,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:05,307 INFO L124 PetriNetUnfolderBase]: 345/2610 cut-off events. [2025-03-14 01:18:05,307 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-03-14 01:18:05,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 2610 events. 345/2610 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 21985 event pairs, 220 based on Foata normal form. 2/2295 useless extension candidates. Maximal degree in co-relation 3055. Up to 381 conditions per place. [2025-03-14 01:18:05,332 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 23 selfloop transitions, 9 changer transitions 0/263 dead transitions. [2025-03-14 01:18:05,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 263 transitions, 618 flow [2025-03-14 01:18:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:18:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:18:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2167 transitions. [2025-03-14 01:18:05,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8787510137875101 [2025-03-14 01:18:05,339 INFO L175 Difference]: Start difference. First operand has 251 places, 255 transitions, 536 flow. Second operand 9 states and 2167 transitions. [2025-03-14 01:18:05,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 263 transitions, 618 flow [2025-03-14 01:18:05,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 263 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:05,343 INFO L231 Difference]: Finished difference. Result has 261 places, 261 transitions, 584 flow [2025-03-14 01:18:05,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=584, PETRI_PLACES=261, PETRI_TRANSITIONS=261} [2025-03-14 01:18:05,344 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, 2 predicate places. [2025-03-14 01:18:05,344 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 261 transitions, 584 flow [2025-03-14 01:18:05,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 239.1) internal successors, (2391), 10 states have internal predecessors, (2391), 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-14 01:18:05,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:05,345 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-14 01:18:05,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 01:18:05,546 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-14 01:18:05,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:18:05,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:05,547 INFO L85 PathProgramCache]: Analyzing trace with hash -565061371, now seen corresponding path program 2 times [2025-03-14 01:18:05,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:05,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008141387] [2025-03-14 01:18:05,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:18:05,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:05,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-14 01:18:05,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:18:05,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:18:05,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:05,668 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-14 01:18:05,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:05,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008141387] [2025-03-14 01:18:05,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008141387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:18:05,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860110047] [2025-03-14 01:18:05,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:18:05,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:05,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:18:05,670 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-14 01:18:05,675 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-14 01:18:05,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-14 01:18:05,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:18:05,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:18:05,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:05,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:18:05,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:05,814 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-14 01:18:05,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:18:05,907 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-14 01:18:05,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860110047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:18:05,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:18:05,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:18:05,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517613050] [2025-03-14 01:18:05,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:18:05,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:18:05,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:05,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:18:05,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:18:05,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 274 [2025-03-14 01:18:05,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 261 transitions, 584 flow. Second operand has 15 states, 15 states have (on average 239.2) internal successors, (3588), 15 states have internal predecessors, (3588), 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-14 01:18:05,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:05,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 274 [2025-03-14 01:18:05,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:06,384 INFO L124 PetriNetUnfolderBase]: 345/2649 cut-off events. [2025-03-14 01:18:06,384 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-03-14 01:18:06,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3200 conditions, 2649 events. 345/2649 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 21967 event pairs, 220 based on Foata normal form. 3/2335 useless extension candidates. Maximal degree in co-relation 3017. Up to 381 conditions per place. [2025-03-14 01:18:06,410 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 26 selfloop transitions, 18 changer transitions 0/275 dead transitions. [2025-03-14 01:18:06,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 275 transitions, 746 flow [2025-03-14 01:18:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:18:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:18:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4313 transitions. [2025-03-14 01:18:06,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.874493106244931 [2025-03-14 01:18:06,418 INFO L175 Difference]: Start difference. First operand has 261 places, 261 transitions, 584 flow. Second operand 18 states and 4313 transitions. [2025-03-14 01:18:06,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 275 transitions, 746 flow [2025-03-14 01:18:06,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 275 transitions, 734 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:06,423 INFO L231 Difference]: Finished difference. Result has 281 places, 271 transitions, 684 flow [2025-03-14 01:18:06,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=684, PETRI_PLACES=281, PETRI_TRANSITIONS=271} [2025-03-14 01:18:06,425 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, 22 predicate places. [2025-03-14 01:18:06,425 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 271 transitions, 684 flow [2025-03-14 01:18:06,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 239.2) internal successors, (3588), 15 states have internal predecessors, (3588), 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-14 01:18:06,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:06,427 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-14 01:18:06,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 01:18:06,627 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-14 01:18:06,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:18:06,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash 275805337, now seen corresponding path program 3 times [2025-03-14 01:18:06,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:06,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637058700] [2025-03-14 01:18:06,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:18:06,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:06,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 8 equivalence classes. [2025-03-14 01:18:06,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 128 of 128 statements. [2025-03-14 01:18:06,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-14 01:18:06,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:18:06,673 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:18:06,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-14 01:18:06,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-14 01:18:06,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:06,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:18:06,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:18:06,699 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:18:06,702 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-14 01:18:06,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-14 01:18:06,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-14 01:18:06,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-14 01:18:06,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-14 01:18:06,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-14 01:18:06,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-14 01:18:06,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-14 01:18:06,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-14 01:18:06,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-14 01:18:06,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-14 01:18:06,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-14 01:18:06,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-14 01:18:06,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-14 01:18:06,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-14 01:18:06,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-14 01:18:06,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-14 01:18:06,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-14 01:18:06,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:18:06,703 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-14 01:18:06,703 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:18:06,703 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 01:18:06,734 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:18:06,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 328 places, 348 transitions, 724 flow [2025-03-14 01:18:06,768 INFO L124 PetriNetUnfolderBase]: 29/382 cut-off events. [2025-03-14 01:18:06,768 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:18:06,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 382 events. 29/382 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1415 event pairs, 0 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 307. Up to 5 conditions per place. [2025-03-14 01:18:06,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 328 places, 348 transitions, 724 flow [2025-03-14 01:18:06,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 328 places, 348 transitions, 724 flow [2025-03-14 01:18:06,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:18:06,775 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;@40a109e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:18:06,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-14 01:18:06,777 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:18:06,777 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:18:06,778 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:18:06,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:06,778 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-14 01:18:06,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:18:06,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 104882602, now seen corresponding path program 1 times [2025-03-14 01:18:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798781953] [2025-03-14 01:18:06,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:06,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:18:06,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:18:06,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:06,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:06,904 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-14 01:18:06,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:06,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798781953] [2025-03-14 01:18:06,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798781953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:06,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:18:06,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:18:06,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484551203] [2025-03-14 01:18:06,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:06,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:18:06,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:06,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:18:06,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:18:07,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 348 [2025-03-14 01:18:07,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 348 transitions, 724 flow. Second operand has 6 states, 6 states have (on average 283.5) internal successors, (1701), 6 states have internal predecessors, (1701), 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-14 01:18:07,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:07,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 348 [2025-03-14 01:18:07,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:14,691 INFO L124 PetriNetUnfolderBase]: 27422/77788 cut-off events. [2025-03-14 01:18:14,691 INFO L125 PetriNetUnfolderBase]: For 9100/9100 co-relation queries the response was YES. [2025-03-14 01:18:15,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113885 conditions, 77788 events. 27422/77788 cut-off events. For 9100/9100 co-relation queries the response was YES. Maximal size of possible extension queue 2935. Compared 1072619 event pairs, 18864 based on Foata normal form. 13732/77272 useless extension candidates. Maximal degree in co-relation 10978. Up to 32089 conditions per place. [2025-03-14 01:18:15,622 INFO L140 encePairwiseOnDemand]: 329/348 looper letters, 42 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2025-03-14 01:18:15,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 323 transitions, 768 flow [2025-03-14 01:18:15,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:18:15,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:18:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2025-03-14 01:18:15,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395593869731801 [2025-03-14 01:18:15,624 INFO L175 Difference]: Start difference. First operand has 328 places, 348 transitions, 724 flow. Second operand 6 states and 1753 transitions. [2025-03-14 01:18:15,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 323 transitions, 768 flow [2025-03-14 01:18:15,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 323 transitions, 762 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-14 01:18:15,633 INFO L231 Difference]: Finished difference. Result has 320 places, 323 transitions, 678 flow [2025-03-14 01:18:15,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=678, PETRI_PLACES=320, PETRI_TRANSITIONS=323} [2025-03-14 01:18:15,634 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -8 predicate places. [2025-03-14 01:18:15,635 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 323 transitions, 678 flow [2025-03-14 01:18:15,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 283.5) internal successors, (1701), 6 states have internal predecessors, (1701), 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-14 01:18:15,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:15,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:18:15,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:18:15,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:18:15,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash 803683252, now seen corresponding path program 1 times [2025-03-14 01:18:15,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:15,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774010450] [2025-03-14 01:18:15,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:15,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:15,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-14 01:18:15,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-14 01:18:15,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:15,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:15,681 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-14 01:18:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774010450] [2025-03-14 01:18:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774010450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:15,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:18:15,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:18:15,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249627819] [2025-03-14 01:18:15,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:15,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:18:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:15,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:18:15,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:18:15,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 348 [2025-03-14 01:18:15,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 323 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 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-14 01:18:15,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:15,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 348 [2025-03-14 01:18:15,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:17,328 INFO L124 PetriNetUnfolderBase]: 2345/13445 cut-off events. [2025-03-14 01:18:17,328 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-14 01:18:17,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16435 conditions, 13445 events. 2345/13445 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 161309 event pairs, 1720 based on Foata normal form. 1/11848 useless extension candidates. Maximal degree in co-relation 16370. Up to 2506 conditions per place. [2025-03-14 01:18:17,445 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 24 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-03-14 01:18:17,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 324 transitions, 734 flow [2025-03-14 01:18:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:18:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:18:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2025-03-14 01:18:17,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022988505747126 [2025-03-14 01:18:17,447 INFO L175 Difference]: Start difference. First operand has 320 places, 323 transitions, 678 flow. Second operand 3 states and 942 transitions. [2025-03-14 01:18:17,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 324 transitions, 734 flow [2025-03-14 01:18:17,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 324 transitions, 722 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:18:17,454 INFO L231 Difference]: Finished difference. Result has 318 places, 324 transitions, 680 flow [2025-03-14 01:18:17,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=318, PETRI_TRANSITIONS=324} [2025-03-14 01:18:17,454 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -10 predicate places. [2025-03-14 01:18:17,455 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 324 transitions, 680 flow [2025-03-14 01:18:17,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 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-14 01:18:17,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:17,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:18:17,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:18:17,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:18:17,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:17,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2122639124, now seen corresponding path program 1 times [2025-03-14 01:18:17,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:17,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756077324] [2025-03-14 01:18:17,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:17,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:17,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-14 01:18:17,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-14 01:18:17,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:17,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:17,511 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-14 01:18:17,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:17,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756077324] [2025-03-14 01:18:17,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756077324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:18:17,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542986165] [2025-03-14 01:18:17,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:17,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:17,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:18:17,513 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-14 01:18:17,515 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-14 01:18:17,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-14 01:18:17,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-14 01:18:17,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:17,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:17,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-14 01:18:17,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:18:17,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:18:17,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542986165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:17,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:18:17,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-14 01:18:17,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327854318] [2025-03-14 01:18:17,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:17,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:18:17,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:17,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:18:17,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:18:17,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 348 [2025-03-14 01:18:17,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 324 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-14 01:18:17,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:17,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 348 [2025-03-14 01:18:17,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:20,514 INFO L124 PetriNetUnfolderBase]: 5494/24147 cut-off events. [2025-03-14 01:18:20,515 INFO L125 PetriNetUnfolderBase]: For 1898/1898 co-relation queries the response was YES. [2025-03-14 01:18:20,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31651 conditions, 24147 events. 5494/24147 cut-off events. For 1898/1898 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 309416 event pairs, 3970 based on Foata normal form. 156/21149 useless extension candidates. Maximal degree in co-relation 31603. Up to 5843 conditions per place. [2025-03-14 01:18:20,740 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 41 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-03-14 01:18:20,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 340 transitions, 813 flow [2025-03-14 01:18:20,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:18:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:18:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2025-03-14 01:18:20,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157088122605364 [2025-03-14 01:18:20,742 INFO L175 Difference]: Start difference. First operand has 318 places, 324 transitions, 680 flow. Second operand 3 states and 956 transitions. [2025-03-14 01:18:20,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 340 transitions, 813 flow [2025-03-14 01:18:20,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 340 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:20,751 INFO L231 Difference]: Finished difference. Result has 320 places, 325 transitions, 690 flow [2025-03-14 01:18:20,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=320, PETRI_TRANSITIONS=325} [2025-03-14 01:18:20,752 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -8 predicate places. [2025-03-14 01:18:20,752 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 325 transitions, 690 flow [2025-03-14 01:18:20,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-14 01:18:20,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:20,753 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-14 01:18:20,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 01:18:20,953 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-14 01:18:20,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:18:20,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:20,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1503085716, now seen corresponding path program 1 times [2025-03-14 01:18:20,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:20,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864812353] [2025-03-14 01:18:20,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:20,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:20,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 01:18:20,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 01:18:20,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:20,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:18:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864812353] [2025-03-14 01:18:21,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864812353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:18:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259373180] [2025-03-14 01:18:21,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:21,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:21,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:18:21,006 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-14 01:18:21,008 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-14 01:18:21,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 01:18:21,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 01:18:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:21,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:21,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:18:21,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:18:21,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:18:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:18:21,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259373180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:18:21,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:18:21,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:18:21,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617301224] [2025-03-14 01:18:21,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:18:21,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:18:21,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:21,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:18:21,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:18:21,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 348 [2025-03-14 01:18:21,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 325 transitions, 690 flow. Second operand has 10 states, 10 states have (on average 304.2) internal successors, (3042), 10 states have internal predecessors, (3042), 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-14 01:18:21,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:21,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 348 [2025-03-14 01:18:21,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:22,899 INFO L124 PetriNetUnfolderBase]: 2346/13479 cut-off events. [2025-03-14 01:18:22,899 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2025-03-14 01:18:23,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16482 conditions, 13479 events. 2346/13479 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 162013 event pairs, 1720 based on Foata normal form. 2/11876 useless extension candidates. Maximal degree in co-relation 16386. Up to 2506 conditions per place. [2025-03-14 01:18:23,281 INFO L140 encePairwiseOnDemand]: 342/348 looper letters, 28 selfloop transitions, 9 changer transitions 0/333 dead transitions. [2025-03-14 01:18:23,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 333 transitions, 782 flow [2025-03-14 01:18:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:18:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:18:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2757 transitions. [2025-03-14 01:18:23,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8802681992337165 [2025-03-14 01:18:23,284 INFO L175 Difference]: Start difference. First operand has 320 places, 325 transitions, 690 flow. Second operand 9 states and 2757 transitions. [2025-03-14 01:18:23,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 333 transitions, 782 flow [2025-03-14 01:18:23,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 333 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:23,290 INFO L231 Difference]: Finished difference. Result has 330 places, 331 transitions, 738 flow [2025-03-14 01:18:23,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=738, PETRI_PLACES=330, PETRI_TRANSITIONS=331} [2025-03-14 01:18:23,291 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, 2 predicate places. [2025-03-14 01:18:23,291 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 331 transitions, 738 flow [2025-03-14 01:18:23,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.2) internal successors, (3042), 10 states have internal predecessors, (3042), 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-14 01:18:23,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:23,292 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-14 01:18:23,298 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-14 01:18:23,493 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-14 01:18:23,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:18:23,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1189562772, now seen corresponding path program 2 times [2025-03-14 01:18:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:23,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455678939] [2025-03-14 01:18:23,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:18:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:23,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-14 01:18:23,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:18:23,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:18:23,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:23,616 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-14 01:18:23,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:23,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455678939] [2025-03-14 01:18:23,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455678939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:18:23,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142177757] [2025-03-14 01:18:23,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:18:23,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:23,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:18:23,618 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:18:23,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-14 01:18:23,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-14 01:18:23,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:18:23,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:18:23,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:23,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:18:23,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:18:23,781 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-14 01:18:23,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:18:23,874 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-14 01:18:23,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142177757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:18:23,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:18:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:18:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208398017] [2025-03-14 01:18:23,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:18:23,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:18:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:23,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:18:23,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:18:23,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 348 [2025-03-14 01:18:23,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 331 transitions, 738 flow. Second operand has 15 states, 15 states have (on average 304.26666666666665) internal successors, (4564), 15 states have internal predecessors, (4564), 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-14 01:18:23,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:23,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 348 [2025-03-14 01:18:23,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:26,085 INFO L124 PetriNetUnfolderBase]: 2346/13518 cut-off events. [2025-03-14 01:18:26,086 INFO L125 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2025-03-14 01:18:26,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16575 conditions, 13518 events. 2346/13518 cut-off events. For 1239/1239 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 161844 event pairs, 1720 based on Foata normal form. 3/11916 useless extension candidates. Maximal degree in co-relation 16390. Up to 2506 conditions per place. [2025-03-14 01:18:26,258 INFO L140 encePairwiseOnDemand]: 342/348 looper letters, 31 selfloop transitions, 18 changer transitions 0/345 dead transitions. [2025-03-14 01:18:26,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 345 transitions, 910 flow [2025-03-14 01:18:26,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:18:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:18:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5488 transitions. [2025-03-14 01:18:26,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.876117496807152 [2025-03-14 01:18:26,262 INFO L175 Difference]: Start difference. First operand has 330 places, 331 transitions, 738 flow. Second operand 18 states and 5488 transitions. [2025-03-14 01:18:26,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 345 transitions, 910 flow [2025-03-14 01:18:26,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 345 transitions, 898 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:18:26,271 INFO L231 Difference]: Finished difference. Result has 350 places, 341 transitions, 838 flow [2025-03-14 01:18:26,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=838, PETRI_PLACES=350, PETRI_TRANSITIONS=341} [2025-03-14 01:18:26,272 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, 22 predicate places. [2025-03-14 01:18:26,272 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 341 transitions, 838 flow [2025-03-14 01:18:26,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 304.26666666666665) internal successors, (4564), 15 states have internal predecessors, (4564), 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-14 01:18:26,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:26,273 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-14 01:18:26,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-14 01:18:26,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:18:26,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:18:26,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1970315428, now seen corresponding path program 3 times [2025-03-14 01:18:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396939691] [2025-03-14 01:18:26,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:18:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:26,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 8 equivalence classes. [2025-03-14 01:18:26,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 134 of 134 statements. [2025-03-14 01:18:26,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-14 01:18:26,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:18:26,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:18:26,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-14 01:18:26,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-14 01:18:26,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:26,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:18:26,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:18:26,552 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:18:26,552 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-14 01:18:26,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-14 01:18:26,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-14 01:18:26,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-14 01:18:26,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-14 01:18:26,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-14 01:18:26,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-14 01:18:26,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-14 01:18:26,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:18:26,554 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-03-14 01:18:26,554 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:18:26,554 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-14 01:18:26,604 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:18:26,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 422 transitions, 884 flow [2025-03-14 01:18:26,668 INFO L124 PetriNetUnfolderBase]: 36/465 cut-off events. [2025-03-14 01:18:26,668 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-14 01:18:26,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 465 events. 36/465 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1913 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 395. Up to 6 conditions per place. [2025-03-14 01:18:26,676 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 422 transitions, 884 flow [2025-03-14 01:18:26,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 422 transitions, 884 flow [2025-03-14 01:18:26,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:18:26,683 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;@40a109e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:18:26,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-14 01:18:26,686 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:18:26,686 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:18:26,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:18:26,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:26,686 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-14 01:18:26,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:18:26,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:26,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2055633552, now seen corresponding path program 1 times [2025-03-14 01:18:26,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159667595] [2025-03-14 01:18:26,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:26,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:18:26,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:18:26,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:26,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:26,843 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-14 01:18:26,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159667595] [2025-03-14 01:18:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159667595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:26,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:18:26,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:18:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274503490] [2025-03-14 01:18:26,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:26,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:18:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:26,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:18:26,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:18:27,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 422 [2025-03-14 01:18:27,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 422 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 344.5) internal successors, (2067), 6 states have internal predecessors, (2067), 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-14 01:18:27,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:27,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 422 [2025-03-14 01:18:27,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand