./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/stateful01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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-2.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 e2334be94e5a4379173e8ce9878c152630508647bf4da61c6cf055a5b5360d8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:57:35,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:57:35,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:57:35,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:57:35,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:57:35,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:57:35,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:57:35,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:57:35,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:57:35,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:57:35,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:57:35,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:57:35,879 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:57:35,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:57:35,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:57:35,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:57:35,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:57:35,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:57:35,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:57:35,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:57:35,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:57:35,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:57:35,879 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:57:35,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:57:35,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:57:35,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:57:35,880 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 -> e2334be94e5a4379173e8ce9878c152630508647bf4da61c6cf055a5b5360d8e [2025-03-13 21:57:36,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:57:36,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:57:36,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:57:36,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:57:36,092 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:57:36,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stateful01-2.i [2025-03-13 21:57:37,279 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501e0f926/1c9d8bfc30154679b802a628f716c558/FLAGafc2fa1aa [2025-03-13 21:57:37,592 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:57:37,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stateful01-2.i [2025-03-13 21:57:37,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501e0f926/1c9d8bfc30154679b802a628f716c558/FLAGafc2fa1aa [2025-03-13 21:57:37,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501e0f926/1c9d8bfc30154679b802a628f716c558 [2025-03-13 21:57:37,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:57:37,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:57:37,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:57:37,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:57:37,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:57:37,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:57:37" (1/1) ... [2025-03-13 21:57:37,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1efb104f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:37, skipping insertion in model container [2025-03-13 21:57:37,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:57:37" (1/1) ... [2025-03-13 21:57:37,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:57:38,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:57:38,136 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:57:38,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:57:38,202 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:57:38,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38 WrapperNode [2025-03-13 21:57:38,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:57:38,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:57:38,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:57:38,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:57:38,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38" (1/1) ... [2025-03-13 21:57:38,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38" (1/1) ... [2025-03-13 21:57:38,234 INFO L138 Inliner]: procedures = 168, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2025-03-13 21:57:38,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:57:38,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:57:38,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:57:38,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:57:38,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38" (1/1) ... [2025-03-13 21:57:38,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38" (1/1) ... [2025-03-13 21:57:38,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38" (1/1) ... [2025-03-13 21:57:38,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38" (1/1) ... [2025-03-13 21:57:38,253 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38" (1/1) ... [2025-03-13 21:57:38,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38" (1/1) ... [2025-03-13 21:57:38,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38" (1/1) ... [2025-03-13 21:57:38,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38" (1/1) ... [2025-03-13 21:57:38,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:57:38,264 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:57:38,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:57:38,267 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:57:38,269 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38" (1/1) ... [2025-03-13 21:57:38,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:57:38,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:38,297 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-13 21:57:38,303 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-13 21:57:38,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:57:38,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:57:38,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:57:38,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:57:38,318 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:57:38,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:57:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:57:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:57:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:57:38,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:57:38,320 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:57:38,417 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:57:38,418 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:57:38,581 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:57:38,581 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:57:38,582 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:57:38,603 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:57:38,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:57:38 BoogieIcfgContainer [2025-03-13 21:57:38,603 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:57:38,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:57:38,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:57:38,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:57:38,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:57:37" (1/3) ... [2025-03-13 21:57:38,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585004c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:57:38, skipping insertion in model container [2025-03-13 21:57:38,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:38" (2/3) ... [2025-03-13 21:57:38,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585004c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:57:38, skipping insertion in model container [2025-03-13 21:57:38,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:57:38" (3/3) ... [2025-03-13 21:57:38,610 INFO L128 eAbstractionObserver]: Analyzing ICFG stateful01-2.i [2025-03-13 21:57:38,621 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:57:38,623 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stateful01-2.i that has 3 procedures, 140 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-13 21:57:38,623 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:57:38,689 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:57:38,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 142 transitions, 298 flow [2025-03-13 21:57:38,776 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2025-03-13 21:57:38,780 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:57:38,783 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-13 21:57:38,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 142 transitions, 298 flow [2025-03-13 21:57:38,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 123 transitions, 258 flow [2025-03-13 21:57:38,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:57:38,803 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;@a4dfc82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:57:38,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-13 21:57:38,813 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:57:38,813 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-13 21:57:38,813 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:57:38,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:38,814 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-13 21:57:38,814 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-13 21:57:38,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:38,819 INFO L85 PathProgramCache]: Analyzing trace with hash -851469160, now seen corresponding path program 1 times [2025-03-13 21:57:38,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:38,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951989472] [2025-03-13 21:57:38,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:38,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:38,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 21:57:38,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 21:57:38,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:38,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:39,025 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-13 21:57:39,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:39,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951989472] [2025-03-13 21:57:39,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951989472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:39,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:39,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:39,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341725051] [2025-03-13 21:57:39,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:39,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:39,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:39,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:39,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:39,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 142 [2025-03-13 21:57:39,126 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-13 21:57:39,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:39,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 142 [2025-03-13 21:57:39,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:39,230 INFO L124 PetriNetUnfolderBase]: 48/400 cut-off events. [2025-03-13 21:57:39,230 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-13 21:57:39,231 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-13 21:57:39,236 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 20 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2025-03-13 21:57:39,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 122 transitions, 300 flow [2025-03-13 21:57:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-03-13 21:57:39,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863849765258216 [2025-03-13 21:57:39,247 INFO L175 Difference]: Start difference. First operand has 130 places, 123 transitions, 258 flow. Second operand 3 states and 368 transitions. [2025-03-13 21:57:39,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 122 transitions, 300 flow [2025-03-13 21:57:39,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 122 transitions, 292 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:57:39,254 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 252 flow [2025-03-13 21:57:39,256 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-13 21:57:39,259 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-03-13 21:57:39,259 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 252 flow [2025-03-13 21:57:39,259 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-13 21:57:39,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:39,259 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-13 21:57:39,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:57:39,261 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-13 21:57:39,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash -461605259, now seen corresponding path program 1 times [2025-03-13 21:57:39,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:39,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120836043] [2025-03-13 21:57:39,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:39,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:39,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:57:39,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:57:39,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:39,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:39,355 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-13 21:57:39,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:39,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120836043] [2025-03-13 21:57:39,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120836043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:39,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:39,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:39,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284136124] [2025-03-13 21:57:39,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:39,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:39,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:39,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:39,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 142 [2025-03-13 21:57:39,387 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-13 21:57:39,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:39,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 142 [2025-03-13 21:57:39,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:39,441 INFO L124 PetriNetUnfolderBase]: 48/399 cut-off events. [2025-03-13 21:57:39,441 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:57:39,442 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-13 21:57:39,443 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 20 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2025-03-13 21:57:39,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 121 transitions, 294 flow [2025-03-13 21:57:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-03-13 21:57:39,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863849765258216 [2025-03-13 21:57:39,445 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 252 flow. Second operand 3 states and 368 transitions. [2025-03-13 21:57:39,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 121 transitions, 294 flow [2025-03-13 21:57:39,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 121 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:39,447 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 250 flow [2025-03-13 21:57:39,448 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-13 21:57:39,448 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-03-13 21:57:39,448 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 250 flow [2025-03-13 21:57:39,449 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-13 21:57:39,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:39,449 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-13 21:57:39,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:57:39,449 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-13 21:57:39,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:39,450 INFO L85 PathProgramCache]: Analyzing trace with hash 195917336, now seen corresponding path program 1 times [2025-03-13 21:57:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:39,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614679543] [2025-03-13 21:57:39,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:39,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:39,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 21:57:39,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 21:57:39,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:39,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:39,501 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-13 21:57:39,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:39,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614679543] [2025-03-13 21:57:39,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614679543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:39,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:39,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:39,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042951418] [2025-03-13 21:57:39,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:39,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:39,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:39,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:39,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:39,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 142 [2025-03-13 21:57:39,524 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-13 21:57:39,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:39,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 142 [2025-03-13 21:57:39,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:39,633 INFO L124 PetriNetUnfolderBase]: 84/526 cut-off events. [2025-03-13 21:57:39,633 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-13 21:57:39,635 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-13 21:57:39,636 INFO L140 encePairwiseOnDemand]: 132/142 looper letters, 32 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2025-03-13 21:57:39,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 360 flow [2025-03-13 21:57:39,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2025-03-13 21:57:39,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9084507042253521 [2025-03-13 21:57:39,641 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 250 flow. Second operand 3 states and 387 transitions. [2025-03-13 21:57:39,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 360 flow [2025-03-13 21:57:39,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 136 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:39,645 INFO L231 Difference]: Finished difference. Result has 127 places, 126 transitions, 300 flow [2025-03-13 21:57:39,645 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-13 21:57:39,645 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-03-13 21:57:39,646 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 126 transitions, 300 flow [2025-03-13 21:57:39,646 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-13 21:57:39,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:39,646 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-13 21:57:39,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:57:39,646 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-13 21:57:39,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash -844014069, now seen corresponding path program 1 times [2025-03-13 21:57:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:39,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842313051] [2025-03-13 21:57:39,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:39,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:39,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-13 21:57:39,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-13 21:57:39,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:39,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:39,703 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-13 21:57:39,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:39,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842313051] [2025-03-13 21:57:39,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842313051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:39,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:39,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:39,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576776503] [2025-03-13 21:57:39,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:39,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:39,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:39,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:39,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:39,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2025-03-13 21:57:39,727 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-13 21:57:39,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:39,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2025-03-13 21:57:39,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:39,799 INFO L124 PetriNetUnfolderBase]: 103/616 cut-off events. [2025-03-13 21:57:39,800 INFO L125 PetriNetUnfolderBase]: For 146/160 co-relation queries the response was YES. [2025-03-13 21:57:39,800 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-13 21:57:39,802 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 29 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2025-03-13 21:57:39,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 136 transitions, 403 flow [2025-03-13 21:57:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-03-13 21:57:39,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8990610328638498 [2025-03-13 21:57:39,804 INFO L175 Difference]: Start difference. First operand has 127 places, 126 transitions, 300 flow. Second operand 3 states and 383 transitions. [2025-03-13 21:57:39,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 136 transitions, 403 flow [2025-03-13 21:57:39,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 136 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:39,806 INFO L231 Difference]: Finished difference. Result has 129 places, 131 transitions, 342 flow [2025-03-13 21:57:39,806 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-13 21:57:39,807 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -1 predicate places. [2025-03-13 21:57:39,807 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 131 transitions, 342 flow [2025-03-13 21:57:39,807 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-13 21:57:39,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:39,808 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-13 21:57:39,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:57:39,808 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-13 21:57:39,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:39,808 INFO L85 PathProgramCache]: Analyzing trace with hash -620819781, now seen corresponding path program 1 times [2025-03-13 21:57:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:39,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183436491] [2025-03-13 21:57:39,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:39,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:39,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 21:57:39,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 21:57:39,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:39,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:39,859 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-13 21:57:39,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:39,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183436491] [2025-03-13 21:57:39,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183436491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:39,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:39,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:39,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475334996] [2025-03-13 21:57:39,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:39,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:39,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:39,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:39,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:39,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2025-03-13 21:57:39,885 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-13 21:57:39,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:39,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2025-03-13 21:57:39,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:39,996 INFO L124 PetriNetUnfolderBase]: 122/738 cut-off events. [2025-03-13 21:57:39,997 INFO L125 PetriNetUnfolderBase]: For 266/274 co-relation queries the response was YES. [2025-03-13 21:57:39,998 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-13 21:57:40,000 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 30 selfloop transitions, 9 changer transitions 0/141 dead transitions. [2025-03-13 21:57:40,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 141 transitions, 455 flow [2025-03-13 21:57:40,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-03-13 21:57:40,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8990610328638498 [2025-03-13 21:57:40,001 INFO L175 Difference]: Start difference. First operand has 129 places, 131 transitions, 342 flow. Second operand 3 states and 383 transitions. [2025-03-13 21:57:40,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 141 transitions, 455 flow [2025-03-13 21:57:40,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 141 transitions, 437 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:40,004 INFO L231 Difference]: Finished difference. Result has 131 places, 136 transitions, 396 flow [2025-03-13 21:57:40,005 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-13 21:57:40,005 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 1 predicate places. [2025-03-13 21:57:40,005 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 136 transitions, 396 flow [2025-03-13 21:57:40,006 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-13 21:57:40,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:40,006 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-13 21:57:40,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:57:40,006 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-13 21:57:40,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:40,007 INFO L85 PathProgramCache]: Analyzing trace with hash -153715057, now seen corresponding path program 1 times [2025-03-13 21:57:40,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:40,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331118242] [2025-03-13 21:57:40,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:40,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:40,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-13 21:57:40,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-13 21:57:40,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:40,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:40,063 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-13 21:57:40,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:40,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331118242] [2025-03-13 21:57:40,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331118242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:40,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:40,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:40,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382944425] [2025-03-13 21:57:40,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:40,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:40,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:40,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:40,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:40,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 142 [2025-03-13 21:57:40,086 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-13 21:57:40,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:40,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 142 [2025-03-13 21:57:40,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:40,162 INFO L124 PetriNetUnfolderBase]: 102/695 cut-off events. [2025-03-13 21:57:40,162 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-03-13 21:57:40,163 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-13 21:57:40,165 INFO L140 encePairwiseOnDemand]: 132/142 looper letters, 30 selfloop transitions, 6 changer transitions 6/151 dead transitions. [2025-03-13 21:57:40,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 151 transitions, 504 flow [2025-03-13 21:57:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2025-03-13 21:57:40,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9061032863849765 [2025-03-13 21:57:40,167 INFO L175 Difference]: Start difference. First operand has 131 places, 136 transitions, 396 flow. Second operand 3 states and 386 transitions. [2025-03-13 21:57:40,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 151 transitions, 504 flow [2025-03-13 21:57:40,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 151 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:40,169 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 413 flow [2025-03-13 21:57:40,170 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-13 21:57:40,170 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-13 21:57:40,170 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 413 flow [2025-03-13 21:57:40,171 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-13 21:57:40,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:40,171 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-13 21:57:40,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:57:40,171 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-13 21:57:40,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:40,172 INFO L85 PathProgramCache]: Analyzing trace with hash -172476457, now seen corresponding path program 1 times [2025-03-13 21:57:40,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:40,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106914733] [2025-03-13 21:57:40,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:40,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-13 21:57:40,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-13 21:57:40,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:40,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:40,278 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-13 21:57:40,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:40,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106914733] [2025-03-13 21:57:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106914733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:40,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:57:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75909775] [2025-03-13 21:57:40,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:40,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:40,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:40,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:40,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 142 [2025-03-13 21:57:40,294 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-13 21:57:40,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:40,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 142 [2025-03-13 21:57:40,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:40,329 INFO L124 PetriNetUnfolderBase]: 12/237 cut-off events. [2025-03-13 21:57:40,330 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-13 21:57:40,330 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-13 21:57:40,331 INFO L140 encePairwiseOnDemand]: 134/142 looper letters, 8 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2025-03-13 21:57:40,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 109 transitions, 307 flow [2025-03-13 21:57:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2025-03-13 21:57:40,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2025-03-13 21:57:40,332 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 413 flow. Second operand 3 states and 392 transitions. [2025-03-13 21:57:40,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 109 transitions, 307 flow [2025-03-13 21:57:40,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 255 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-03-13 21:57:40,337 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 233 flow [2025-03-13 21:57:40,338 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-13 21:57:40,338 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -18 predicate places. [2025-03-13 21:57:40,338 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 233 flow [2025-03-13 21:57:40,338 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-13 21:57:40,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:40,339 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-13 21:57:40,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:57:40,339 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-13 21:57:40,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:40,339 INFO L85 PathProgramCache]: Analyzing trace with hash -422022077, now seen corresponding path program 1 times [2025-03-13 21:57:40,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:40,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277727898] [2025-03-13 21:57:40,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:40,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:40,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 21:57:40,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 21:57:40,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:40,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:40,387 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-13 21:57:40,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:40,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277727898] [2025-03-13 21:57:40,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277727898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:40,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:40,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:40,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957482613] [2025-03-13 21:57:40,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:40,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:40,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:40,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:40,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:40,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2025-03-13 21:57:40,411 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-13 21:57:40,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:40,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2025-03-13 21:57:40,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:40,449 INFO L124 PetriNetUnfolderBase]: 19/268 cut-off events. [2025-03-13 21:57:40,450 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-13 21:57:40,450 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-13 21:57:40,451 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 17 selfloop transitions, 2 changer transitions 4/107 dead transitions. [2025-03-13 21:57:40,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 107 transitions, 274 flow [2025-03-13 21:57:40,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-03-13 21:57:40,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8732394366197183 [2025-03-13 21:57:40,452 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 233 flow. Second operand 3 states and 372 transitions. [2025-03-13 21:57:40,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 107 transitions, 274 flow [2025-03-13 21:57:40,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 107 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:40,454 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 218 flow [2025-03-13 21:57:40,454 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-13 21:57:40,455 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -18 predicate places. [2025-03-13 21:57:40,455 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 218 flow [2025-03-13 21:57:40,455 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-13 21:57:40,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:40,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:40,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:57:40,455 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-13 21:57:40,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2139896783, now seen corresponding path program 1 times [2025-03-13 21:57:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:40,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115949348] [2025-03-13 21:57:40,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:40,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:40,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 21:57:40,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 21:57:40,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:40,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:40,493 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-13 21:57:40,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:40,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115949348] [2025-03-13 21:57:40,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115949348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:40,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:40,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347874096] [2025-03-13 21:57:40,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:40,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:40,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:40,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:40,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:40,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2025-03-13 21:57:40,517 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-13 21:57:40,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:40,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2025-03-13 21:57:40,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:40,547 INFO L124 PetriNetUnfolderBase]: 16/228 cut-off events. [2025-03-13 21:57:40,547 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-13 21:57:40,547 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-13 21:57:40,547 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 0 selfloop transitions, 0 changer transitions 102/102 dead transitions. [2025-03-13 21:57:40,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 102 transitions, 257 flow [2025-03-13 21:57:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-03-13 21:57:40,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8708920187793427 [2025-03-13 21:57:40,549 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 218 flow. Second operand 3 states and 371 transitions. [2025-03-13 21:57:40,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 102 transitions, 257 flow [2025-03-13 21:57:40,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:40,550 INFO L231 Difference]: Finished difference. Result has 107 places, 0 transitions, 0 flow [2025-03-13 21:57:40,550 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-13 21:57:40,551 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -23 predicate places. [2025-03-13 21:57:40,551 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 0 transitions, 0 flow [2025-03-13 21:57:40,552 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-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2025-03-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-13 21:57:40,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 22 remaining) [2025-03-13 21:57:40,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 22 remaining) [2025-03-13 21:57:40,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-13 21:57:40,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-13 21:57:40,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-13 21:57:40,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-13 21:57:40,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-13 21:57:40,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-13 21:57:40,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-13 21:57:40,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-13 21:57:40,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:57:40,557 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:40,561 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:57:40,561 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:57:40,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:57:40 BasicIcfg [2025-03-13 21:57:40,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:57:40,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:57:40,567 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:57:40,567 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:57:40,568 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:57:38" (3/4) ... [2025-03-13 21:57:40,569 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:57:40,571 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 21:57:40,571 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 21:57:40,575 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-13 21:57:40,575 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 21:57:40,575 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 21:57:40,575 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 21:57:40,636 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:57:40,636 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:57:40,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:57:40,637 INFO L158 Benchmark]: Toolchain (without parser) took 2786.79ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 104.2MB in the beginning and 202.2MB in the end (delta: -98.0MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2025-03-13 21:57:40,637 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:57:40,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.19ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 84.1MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:57:40,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.92ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:57:40,638 INFO L158 Benchmark]: Boogie Preprocessor took 28.63ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:57:40,638 INFO L158 Benchmark]: IcfgBuilder took 339.50ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 64.0MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:57:40,639 INFO L158 Benchmark]: TraceAbstraction took 1961.35ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 62.9MB in the beginning and 209.3MB in the end (delta: -146.4MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2025-03-13 21:57:40,639 INFO L158 Benchmark]: Witness Printer took 69.07ms. Allocated memory is still 302.0MB. Free memory was 209.3MB in the beginning and 202.2MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:57:40,640 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.24ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.19ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 84.1MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.92ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.63ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 339.50ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 64.0MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1961.35ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 62.9MB in the beginning and 209.3MB in the end (delta: -146.4MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Witness Printer took 69.07ms. Allocated memory is still 302.0MB. Free memory was 209.3MB in the beginning and 202.2MB in the end (delta: 7.1MB). 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: 1.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.3s 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-13 21:57:40,657 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