./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/stateful01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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/stateful01-1.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 4f746010868b331b940ee2293ff3d78b9aa516b26fde95d84f76493b23741d03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:23:32,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:23:33,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:23:33,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:23:33,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:23:33,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:23:33,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:23:33,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:23:33,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:23:33,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:23:33,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:23:33,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:23:33,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:23:33,043 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:23:33,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:23:33,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:23:33,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:23:33,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:23:33,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:23:33,044 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:23:33,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:23:33,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:23:33,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:23:33,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:23:33,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:23:33,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:23:33,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:23:33,044 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 -> 4f746010868b331b940ee2293ff3d78b9aa516b26fde95d84f76493b23741d03 [2025-03-04 06:23:33,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:23:33,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:23:33,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:23:33,293 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:23:33,293 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:23:33,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stateful01-1.i [2025-03-04 06:23:34,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841eceb25/b5951f8513814786b75005e32f7d74ed/FLAGb0525f76a [2025-03-04 06:23:34,764 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:23:34,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stateful01-1.i [2025-03-04 06:23:34,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841eceb25/b5951f8513814786b75005e32f7d74ed/FLAGb0525f76a [2025-03-04 06:23:35,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841eceb25/b5951f8513814786b75005e32f7d74ed [2025-03-04 06:23:35,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:23:35,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:23:35,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:23:35,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:23:35,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:23:35,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbe7ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35, skipping insertion in model container [2025-03-04 06:23:35,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:23:35,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:23:35,261 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:23:35,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:23:35,322 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:23:35,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35 WrapperNode [2025-03-04 06:23:35,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:23:35,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:23:35,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:23:35,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:23:35,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,346 INFO L138 Inliner]: procedures = 168, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2025-03-04 06:23:35,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:23:35,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:23:35,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:23:35,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:23:35,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:23:35,360 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:23:35,360 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:23:35,360 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:23:35,360 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35" (1/1) ... [2025-03-04 06:23:35,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:23:35,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:23:35,395 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-04 06:23:35,397 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-04 06:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:23:35,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:23:35,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:23:35,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:23:35,415 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:23:35,515 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:23:35,517 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:23:35,723 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:23:35,724 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:23:35,757 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:23:35,759 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:23:35,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:23:35 BoogieIcfgContainer [2025-03-04 06:23:35,759 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:23:35,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:23:35,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:23:35,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:23:35,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:23:35" (1/3) ... [2025-03-04 06:23:35,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9ead43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:23:35, skipping insertion in model container [2025-03-04 06:23:35,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:23:35" (2/3) ... [2025-03-04 06:23:35,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9ead43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:23:35, skipping insertion in model container [2025-03-04 06:23:35,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:23:35" (3/3) ... [2025-03-04 06:23:35,767 INFO L128 eAbstractionObserver]: Analyzing ICFG stateful01-1.i [2025-03-04 06:23:35,778 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:23:35,780 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stateful01-1.i that has 3 procedures, 140 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-04 06:23:35,781 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:23:35,841 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:23:35,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 142 transitions, 298 flow [2025-03-04 06:23:35,938 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2025-03-04 06:23:35,941 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:23:35,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 140 events. 3/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 137 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-03-04 06:23:35,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 142 transitions, 298 flow [2025-03-04 06:23:35,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 123 transitions, 258 flow [2025-03-04 06:23:35,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:23:35,969 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;@5ac8ca2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:23:35,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 06:23:35,981 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:23:35,982 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-04 06:23:35,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:23:35,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:35,983 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] [2025-03-04 06:23:35,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:23:35,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:35,989 INFO L85 PathProgramCache]: Analyzing trace with hash -851469160, now seen corresponding path program 1 times [2025-03-04 06:23:35,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192459387] [2025-03-04 06:23:35,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:35,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:36,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:23:36,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:23:36,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:36,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:36,196 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-04 06:23:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:36,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192459387] [2025-03-04 06:23:36,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192459387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:36,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:36,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:23:36,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276528056] [2025-03-04 06:23:36,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:36,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:36,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:36,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:36,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:36,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 142 [2025-03-04 06:23:36,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 123 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-04 06:23:36,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:36,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 142 [2025-03-04 06:23:36,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:36,434 INFO L124 PetriNetUnfolderBase]: 48/400 cut-off events. [2025-03-04 06:23:36,436 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 06:23:36,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 400 events. 48/400 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1774 event pairs, 48 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 447. Up to 117 conditions per place. [2025-03-04 06:23:36,442 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 20 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2025-03-04 06:23:36,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 122 transitions, 300 flow [2025-03-04 06:23:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-03-04 06:23:36,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863849765258216 [2025-03-04 06:23:36,457 INFO L175 Difference]: Start difference. First operand has 130 places, 123 transitions, 258 flow. Second operand 3 states and 368 transitions. [2025-03-04 06:23:36,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 122 transitions, 300 flow [2025-03-04 06:23:36,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 122 transitions, 292 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:23:36,467 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 252 flow [2025-03-04 06:23:36,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2025-03-04 06:23:36,472 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-03-04 06:23:36,473 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 252 flow [2025-03-04 06:23:36,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-04 06:23:36,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:36,475 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] [2025-03-04 06:23:36,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:23:36,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:23:36,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:36,476 INFO L85 PathProgramCache]: Analyzing trace with hash -461605259, now seen corresponding path program 1 times [2025-03-04 06:23:36,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:36,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439626045] [2025-03-04 06:23:36,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:36,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:36,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 06:23:36,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 06:23:36,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:36,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:36,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:23:36,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:36,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439626045] [2025-03-04 06:23:36,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439626045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:36,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:36,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:23:36,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890296717] [2025-03-04 06:23:36,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:36,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:36,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:36,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:36,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:36,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 142 [2025-03-04 06:23:36,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-04 06:23:36,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:36,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 142 [2025-03-04 06:23:36,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:36,669 INFO L124 PetriNetUnfolderBase]: 48/399 cut-off events. [2025-03-04 06:23:36,669 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:23:36,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 399 events. 48/399 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1739 event pairs, 48 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 491. Up to 117 conditions per place. [2025-03-04 06:23:36,671 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 20 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2025-03-04 06:23:36,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 121 transitions, 294 flow [2025-03-04 06:23:36,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-03-04 06:23:36,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863849765258216 [2025-03-04 06:23:36,673 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 252 flow. Second operand 3 states and 368 transitions. [2025-03-04 06:23:36,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 121 transitions, 294 flow [2025-03-04 06:23:36,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 121 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:23:36,675 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 250 flow [2025-03-04 06:23:36,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2025-03-04 06:23:36,676 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-03-04 06:23:36,676 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 250 flow [2025-03-04 06:23:36,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-04 06:23:36,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:36,677 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] [2025-03-04 06:23:36,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:23:36,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:23:36,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash 195917336, now seen corresponding path program 1 times [2025-03-04 06:23:36,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321637315] [2025-03-04 06:23:36,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:36,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 06:23:36,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 06:23:36,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:36,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:23:36,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:36,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321637315] [2025-03-04 06:23:36,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321637315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:36,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:36,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:23:36,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272486579] [2025-03-04 06:23:36,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:36,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:36,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:36,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:36,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:36,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 142 [2025-03-04 06:23:36,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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-04 06:23:36,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:36,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 142 [2025-03-04 06:23:36,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:36,882 INFO L124 PetriNetUnfolderBase]: 84/526 cut-off events. [2025-03-04 06:23:36,882 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 06:23:36,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 526 events. 84/526 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2702 event pairs, 38 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 691. Up to 129 conditions per place. [2025-03-04 06:23:36,885 INFO L140 encePairwiseOnDemand]: 132/142 looper letters, 32 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2025-03-04 06:23:36,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 360 flow [2025-03-04 06:23:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2025-03-04 06:23:36,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9084507042253521 [2025-03-04 06:23:36,887 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 250 flow. Second operand 3 states and 387 transitions. [2025-03-04 06:23:36,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 360 flow [2025-03-04 06:23:36,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 136 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:23:36,892 INFO L231 Difference]: Finished difference. Result has 127 places, 126 transitions, 300 flow [2025-03-04 06:23:36,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=127, PETRI_TRANSITIONS=126} [2025-03-04 06:23:36,893 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-03-04 06:23:36,893 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 126 transitions, 300 flow [2025-03-04 06:23:36,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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-04 06:23:36,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:36,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:36,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:23:36,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:23:36,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:36,896 INFO L85 PathProgramCache]: Analyzing trace with hash -844014069, now seen corresponding path program 1 times [2025-03-04 06:23:36,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:36,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078037967] [2025-03-04 06:23:36,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:36,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:36,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:23:36,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:23:36,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:36,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:36,951 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-04 06:23:36,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:36,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078037967] [2025-03-04 06:23:36,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078037967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:36,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:36,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:23:36,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242789517] [2025-03-04 06:23:36,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:36,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:36,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:36,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:36,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:36,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2025-03-04 06:23:36,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 126 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-04 06:23:36,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:36,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2025-03-04 06:23:36,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:37,071 INFO L124 PetriNetUnfolderBase]: 103/616 cut-off events. [2025-03-04 06:23:37,072 INFO L125 PetriNetUnfolderBase]: For 146/160 co-relation queries the response was YES. [2025-03-04 06:23:37,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 616 events. 103/616 cut-off events. For 146/160 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3567 event pairs, 60 based on Foata normal form. 6/565 useless extension candidates. Maximal degree in co-relation 812. Up to 195 conditions per place. [2025-03-04 06:23:37,077 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 29 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2025-03-04 06:23:37,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 136 transitions, 403 flow [2025-03-04 06:23:37,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-03-04 06:23:37,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8990610328638498 [2025-03-04 06:23:37,078 INFO L175 Difference]: Start difference. First operand has 127 places, 126 transitions, 300 flow. Second operand 3 states and 383 transitions. [2025-03-04 06:23:37,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 136 transitions, 403 flow [2025-03-04 06:23:37,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 136 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:23:37,082 INFO L231 Difference]: Finished difference. Result has 129 places, 131 transitions, 342 flow [2025-03-04 06:23:37,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=129, PETRI_TRANSITIONS=131} [2025-03-04 06:23:37,083 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -1 predicate places. [2025-03-04 06:23:37,083 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 131 transitions, 342 flow [2025-03-04 06:23:37,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-04 06:23:37,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:37,083 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] [2025-03-04 06:23:37,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:23:37,084 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:23:37,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash -620819781, now seen corresponding path program 1 times [2025-03-04 06:23:37,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:37,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608931645] [2025-03-04 06:23:37,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:37,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:23:37,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:23:37,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:37,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:37,141 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-04 06:23:37,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:37,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608931645] [2025-03-04 06:23:37,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608931645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:37,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:37,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:23:37,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205088797] [2025-03-04 06:23:37,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:37,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:37,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:37,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:37,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:37,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2025-03-04 06:23:37,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 131 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-04 06:23:37,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:37,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2025-03-04 06:23:37,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:37,266 INFO L124 PetriNetUnfolderBase]: 122/738 cut-off events. [2025-03-04 06:23:37,266 INFO L125 PetriNetUnfolderBase]: For 266/274 co-relation queries the response was YES. [2025-03-04 06:23:37,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 738 events. 122/738 cut-off events. For 266/274 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4439 event pairs, 62 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 1025. Up to 220 conditions per place. [2025-03-04 06:23:37,270 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 30 selfloop transitions, 9 changer transitions 0/141 dead transitions. [2025-03-04 06:23:37,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 141 transitions, 455 flow [2025-03-04 06:23:37,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-03-04 06:23:37,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8990610328638498 [2025-03-04 06:23:37,272 INFO L175 Difference]: Start difference. First operand has 129 places, 131 transitions, 342 flow. Second operand 3 states and 383 transitions. [2025-03-04 06:23:37,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 141 transitions, 455 flow [2025-03-04 06:23:37,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 141 transitions, 437 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:23:37,277 INFO L231 Difference]: Finished difference. Result has 131 places, 136 transitions, 396 flow [2025-03-04 06:23:37,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=131, PETRI_TRANSITIONS=136} [2025-03-04 06:23:37,280 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 1 predicate places. [2025-03-04 06:23:37,280 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 136 transitions, 396 flow [2025-03-04 06:23:37,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-04 06:23:37,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:37,281 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] [2025-03-04 06:23:37,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:23:37,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:23:37,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:37,283 INFO L85 PathProgramCache]: Analyzing trace with hash -153715057, now seen corresponding path program 1 times [2025-03-04 06:23:37,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:37,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233553123] [2025-03-04 06:23:37,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:37,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:37,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:23:37,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:23:37,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:37,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:37,336 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-04 06:23:37,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:37,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233553123] [2025-03-04 06:23:37,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233553123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:37,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:37,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:23:37,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437126739] [2025-03-04 06:23:37,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:37,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:37,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:37,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:37,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:37,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 142 [2025-03-04 06:23:37,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 136 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-04 06:23:37,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:37,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 142 [2025-03-04 06:23:37,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:37,454 INFO L124 PetriNetUnfolderBase]: 102/695 cut-off events. [2025-03-04 06:23:37,454 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-03-04 06:23:37,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 695 events. 102/695 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4138 event pairs, 44 based on Foata normal form. 1/649 useless extension candidates. Maximal degree in co-relation 986. Up to 146 conditions per place. [2025-03-04 06:23:37,461 INFO L140 encePairwiseOnDemand]: 132/142 looper letters, 30 selfloop transitions, 6 changer transitions 6/151 dead transitions. [2025-03-04 06:23:37,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 151 transitions, 504 flow [2025-03-04 06:23:37,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2025-03-04 06:23:37,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9061032863849765 [2025-03-04 06:23:37,465 INFO L175 Difference]: Start difference. First operand has 131 places, 136 transitions, 396 flow. Second operand 3 states and 386 transitions. [2025-03-04 06:23:37,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 151 transitions, 504 flow [2025-03-04 06:23:37,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 151 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:23:37,470 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 413 flow [2025-03-04 06:23:37,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=413, PETRI_PLACES=132, PETRI_TRANSITIONS=135} [2025-03-04 06:23:37,471 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-04 06:23:37,472 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 413 flow [2025-03-04 06:23:37,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-04 06:23:37,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:37,473 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] [2025-03-04 06:23:37,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:23:37,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:23:37,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:37,474 INFO L85 PathProgramCache]: Analyzing trace with hash -172476457, now seen corresponding path program 1 times [2025-03-04 06:23:37,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:37,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779663759] [2025-03-04 06:23:37,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:37,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:37,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:23:37,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:23:37,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:37,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:37,593 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-04 06:23:37,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:37,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779663759] [2025-03-04 06:23:37,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779663759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:37,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:37,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:23:37,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334279488] [2025-03-04 06:23:37,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:37,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:37,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:37,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:37,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:37,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 142 [2025-03-04 06:23:37,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 135 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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-04 06:23:37,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:37,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 142 [2025-03-04 06:23:37,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:37,640 INFO L124 PetriNetUnfolderBase]: 12/237 cut-off events. [2025-03-04 06:23:37,641 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 06:23:37,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 237 events. 12/237 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 589 event pairs, 4 based on Foata normal form. 8/235 useless extension candidates. Maximal degree in co-relation 180. Up to 27 conditions per place. [2025-03-04 06:23:37,641 INFO L140 encePairwiseOnDemand]: 134/142 looper letters, 8 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2025-03-04 06:23:37,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 109 transitions, 307 flow [2025-03-04 06:23:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2025-03-04 06:23:37,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2025-03-04 06:23:37,643 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 413 flow. Second operand 3 states and 392 transitions. [2025-03-04 06:23:37,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 109 transitions, 307 flow [2025-03-04 06:23:37,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 255 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-03-04 06:23:37,645 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 233 flow [2025-03-04 06:23:37,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2025-03-04 06:23:37,646 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -18 predicate places. [2025-03-04 06:23:37,646 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 233 flow [2025-03-04 06:23:37,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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-04 06:23:37,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:37,647 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] [2025-03-04 06:23:37,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:23:37,647 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:23:37,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash -422022077, now seen corresponding path program 1 times [2025-03-04 06:23:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:37,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548720773] [2025-03-04 06:23:37,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:37,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:37,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:23:37,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:23:37,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:37,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:37,697 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-04 06:23:37,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:37,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548720773] [2025-03-04 06:23:37,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548720773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:37,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:37,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:23:37,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678048817] [2025-03-04 06:23:37,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:37,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:37,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:37,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:37,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:37,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2025-03-04 06:23:37,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-04 06:23:37,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:37,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2025-03-04 06:23:37,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:37,758 INFO L124 PetriNetUnfolderBase]: 19/268 cut-off events. [2025-03-04 06:23:37,758 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-04 06:23:37,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 268 events. 19/268 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 796 event pairs, 17 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 222. Up to 70 conditions per place. [2025-03-04 06:23:37,759 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 17 selfloop transitions, 2 changer transitions 4/107 dead transitions. [2025-03-04 06:23:37,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 107 transitions, 274 flow [2025-03-04 06:23:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-03-04 06:23:37,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8732394366197183 [2025-03-04 06:23:37,760 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 233 flow. Second operand 3 states and 372 transitions. [2025-03-04 06:23:37,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 107 transitions, 274 flow [2025-03-04 06:23:37,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 107 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:23:37,762 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 218 flow [2025-03-04 06:23:37,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2025-03-04 06:23:37,762 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -18 predicate places. [2025-03-04 06:23:37,763 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 218 flow [2025-03-04 06:23:37,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-04 06:23:37,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:37,763 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-04 06:23:37,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:23:37,763 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:23:37,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:37,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2139896783, now seen corresponding path program 1 times [2025-03-04 06:23:37,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:37,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986999310] [2025-03-04 06:23:37,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:37,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:37,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:23:37,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:23:37,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:37,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:37,805 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-04 06:23:37,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:37,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986999310] [2025-03-04 06:23:37,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986999310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:37,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:37,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:23:37,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465410378] [2025-03-04 06:23:37,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:37,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:37,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:37,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:37,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:37,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2025-03-04 06:23:37,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-04 06:23:37,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:37,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2025-03-04 06:23:37,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:37,853 INFO L124 PetriNetUnfolderBase]: 16/228 cut-off events. [2025-03-04 06:23:37,853 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-04 06:23:37,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 228 events. 16/228 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 581 event pairs, 14 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 201. Up to 59 conditions per place. [2025-03-04 06:23:37,854 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 0 selfloop transitions, 0 changer transitions 102/102 dead transitions. [2025-03-04 06:23:37,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 102 transitions, 257 flow [2025-03-04 06:23:37,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-03-04 06:23:37,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8708920187793427 [2025-03-04 06:23:37,855 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 218 flow. Second operand 3 states and 371 transitions. [2025-03-04 06:23:37,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 102 transitions, 257 flow [2025-03-04 06:23:37,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:23:37,857 INFO L231 Difference]: Finished difference. Result has 107 places, 0 transitions, 0 flow [2025-03-04 06:23:37,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=107, PETRI_TRANSITIONS=0} [2025-03-04 06:23:37,857 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -23 predicate places. [2025-03-04 06:23:37,857 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 0 transitions, 0 flow [2025-03-04 06:23:37,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-04 06:23:37,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2025-03-04 06:23:37,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-04 06:23:37,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-04 06:23:37,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-04 06:23:37,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-04 06:23:37,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-04 06:23:37,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-04 06:23:37,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-04 06:23:37,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-04 06:23:37,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-04 06:23:37,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:23:37,862 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:37,865 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:23:37,866 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:23:37,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:23:37 BasicIcfg [2025-03-04 06:23:37,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:23:37,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:23:37,870 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:23:37,870 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:23:37,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:23:35" (3/4) ... [2025-03-04 06:23:37,875 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:23:37,878 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:23:37,878 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:23:37,880 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 06:23:37,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:23:37,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:23:37,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:23:37,942 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:23:37,943 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:23:37,943 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:23:37,943 INFO L158 Benchmark]: Toolchain (without parser) took 2900.91ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 107.8MB in the end (delta: 4.2MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2025-03-04 06:23:37,944 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 226.5MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:23:37,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.26ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 91.8MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:23:37,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.16ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 90.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:23:37,945 INFO L158 Benchmark]: Boogie Preprocessor took 12.20ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 88.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:23:37,946 INFO L158 Benchmark]: IcfgBuilder took 399.73ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 71.0MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:23:37,946 INFO L158 Benchmark]: TraceAbstraction took 2108.73ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 46.6MB in the end (delta: 23.9MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2025-03-04 06:23:37,947 INFO L158 Benchmark]: Witness Printer took 72.39ms. Allocated memory is still 142.6MB. Free memory was 46.6MB in the beginning and 107.8MB in the end (delta: -61.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:23:37,948 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 226.5MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.26ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 91.8MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.16ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 90.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.20ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 88.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 399.73ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 71.0MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2108.73ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 46.6MB in the end (delta: 23.9MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 72.39ms. Allocated memory is still 142.6MB. Free memory was 46.6MB in the beginning and 107.8MB in the end (delta: -61.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 700]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 700]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 719]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 720]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 725]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 725]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 206 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 47 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 470 ConstructedInterpolants, 0 QuantifiedInterpolants, 504 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:23:37,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE