./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/stack-1.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/stack-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:57:09,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:57:09,556 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:09,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:57:09,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:57:09,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:57:09,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:57:09,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:57:09,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:57:09,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:57:09,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:57:09,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:57:09,585 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:57:09,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:57:09,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:57:09,586 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:57:09,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:57:09,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:57:09,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:57:09,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:57:09,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:57:09,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:57:09,587 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:57:09,587 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:57:09,587 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:57:09,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:57:09,587 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:57:09,587 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:57:09,587 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:57:09,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:57:09,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:57:09,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:57:09,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:57:09,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:57:09,588 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:57:09,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:57:09,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:57:09,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:57:09,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:57:09,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:57:09,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:57:09,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:57:09,589 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 -> a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 [2025-03-13 21:57:09,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:57:09,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:57:09,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:57:09,826 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:57:09,827 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:57:09,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-1.i [2025-03-13 21:57:11,016 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27dcccbf9/98d51eb7bf3546f8bbd252b12fdad946/FLAG93df21b42 [2025-03-13 21:57:11,364 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:57:11,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-1.i [2025-03-13 21:57:11,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27dcccbf9/98d51eb7bf3546f8bbd252b12fdad946/FLAG93df21b42 [2025-03-13 21:57:11,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27dcccbf9/98d51eb7bf3546f8bbd252b12fdad946 [2025-03-13 21:57:11,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:57:11,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:57:11,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:57:11,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:57:11,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:57:11,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:57:11" (1/1) ... [2025-03-13 21:57:11,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1296832a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:11, skipping insertion in model container [2025-03-13 21:57:11,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:57:11" (1/1) ... [2025-03-13 21:57:11,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:57:11,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:57:11,769 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:57:11,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:57:11,854 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:57:11,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:11 WrapperNode [2025-03-13 21:57:11,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:57:11,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:57:11,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:57:11,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:57:11,860 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:11" (1/1) ... [2025-03-13 21:57:11,870 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:11" (1/1) ... [2025-03-13 21:57:11,885 INFO L138 Inliner]: procedures = 277, calls = 36, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 182 [2025-03-13 21:57:11,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:57:11,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:57:11,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:57:11,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:57:11,891 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:11" (1/1) ... [2025-03-13 21:57:11,891 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:11" (1/1) ... [2025-03-13 21:57:11,898 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:11" (1/1) ... [2025-03-13 21:57:11,898 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:11" (1/1) ... [2025-03-13 21:57:11,907 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:11" (1/1) ... [2025-03-13 21:57:11,909 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:11" (1/1) ... [2025-03-13 21:57:11,910 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:11" (1/1) ... [2025-03-13 21:57:11,911 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:11" (1/1) ... [2025-03-13 21:57:11,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:57:11,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:57:11,919 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:57:11,919 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:57:11,920 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:11" (1/1) ... [2025-03-13 21:57:11,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:57:11,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:11,944 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:11,947 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:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-13 21:57:11,964 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-13 21:57:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-13 21:57:11,964 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-13 21:57:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:57:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 21:57:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 21:57:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:57:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:57:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:57:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:57:11,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:57:11,966 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:12,060 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:57:12,062 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:57:12,279 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0; [2025-03-13 21:57:12,280 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem40#1; [2025-03-13 21:57:12,280 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret39#1; [2025-03-13 21:57:12,280 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:57:12,281 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:57:12,281 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:57:12,303 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:57:12,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:57:12 BoogieIcfgContainer [2025-03-13 21:57:12,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:57:12,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:57:12,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:57:12,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:57:12,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:57:11" (1/3) ... [2025-03-13 21:57:12,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612ebd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:57:12, skipping insertion in model container [2025-03-13 21:57:12,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:11" (2/3) ... [2025-03-13 21:57:12,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612ebd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:57:12, skipping insertion in model container [2025-03-13 21:57:12,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:57:12" (3/3) ... [2025-03-13 21:57:12,313 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-1.i [2025-03-13 21:57:12,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:57:12,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-1.i that has 3 procedures, 199 locations, 1 initial locations, 2 loop locations, and 11 error locations. [2025-03-13 21:57:12,326 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:57:12,405 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:57:12,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 208 transitions, 430 flow [2025-03-13 21:57:12,501 INFO L124 PetriNetUnfolderBase]: 10/206 cut-off events. [2025-03-13 21:57:12,504 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:57:12,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 206 events. 10/206 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 505 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 171. Up to 3 conditions per place. [2025-03-13 21:57:12,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 208 transitions, 430 flow [2025-03-13 21:57:12,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 201 transitions, 411 flow [2025-03-13 21:57:12,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:57:12,533 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;@41255176, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:57:12,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-13 21:57:12,544 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:57:12,544 INFO L124 PetriNetUnfolderBase]: 0/66 cut-off events. [2025-03-13 21:57:12,544 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:57:12,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:12,549 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] [2025-03-13 21:57:12,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-13 21:57:12,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:12,553 INFO L85 PathProgramCache]: Analyzing trace with hash 315984762, now seen corresponding path program 1 times [2025-03-13 21:57:12,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:12,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86253796] [2025-03-13 21:57:12,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:12,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:12,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-13 21:57:12,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-13 21:57:12,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:12,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:12,730 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:12,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:12,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86253796] [2025-03-13 21:57:12,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86253796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:12,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:12,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068242497] [2025-03-13 21:57:12,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:12,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:12,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:12,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:12,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 208 [2025-03-13 21:57:12,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 201 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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:12,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:12,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 208 [2025-03-13 21:57:12,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:13,116 INFO L124 PetriNetUnfolderBase]: 274/2373 cut-off events. [2025-03-13 21:57:13,116 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-03-13 21:57:13,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 2373 events. 274/2373 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 17047 event pairs, 76 based on Foata normal form. 138/2267 useless extension candidates. Maximal degree in co-relation 2779. Up to 405 conditions per place. [2025-03-13 21:57:13,133 INFO L140 encePairwiseOnDemand]: 180/208 looper letters, 36 selfloop transitions, 16 changer transitions 0/212 dead transitions. [2025-03-13 21:57:13,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 212 transitions, 543 flow [2025-03-13 21:57:13,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2025-03-13 21:57:13,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278846153846154 [2025-03-13 21:57:13,151 INFO L175 Difference]: Start difference. First operand has 198 places, 201 transitions, 411 flow. Second operand 3 states and 579 transitions. [2025-03-13 21:57:13,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 212 transitions, 543 flow [2025-03-13 21:57:13,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 212 transitions, 535 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:57:13,160 INFO L231 Difference]: Finished difference. Result has 193 places, 206 transitions, 526 flow [2025-03-13 21:57:13,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=193, PETRI_TRANSITIONS=206} [2025-03-13 21:57:13,166 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, -5 predicate places. [2025-03-13 21:57:13,167 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 206 transitions, 526 flow [2025-03-13 21:57:13,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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:13,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:13,167 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:13,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:57:13,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-13 21:57:13,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash 772768461, now seen corresponding path program 1 times [2025-03-13 21:57:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:13,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919833370] [2025-03-13 21:57:13,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:13,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-13 21:57:13,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-13 21:57:13,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:13,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:13,311 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:13,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:13,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919833370] [2025-03-13 21:57:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919833370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:57:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865526661] [2025-03-13 21:57:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:13,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:13,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:13,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:13,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:13,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 208 [2025-03-13 21:57:13,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 206 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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:13,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:13,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 208 [2025-03-13 21:57:13,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:13,649 INFO L124 PetriNetUnfolderBase]: 277/3024 cut-off events. [2025-03-13 21:57:13,649 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2025-03-13 21:57:13,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3878 conditions, 3024 events. 277/3024 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22708 event pairs, 91 based on Foata normal form. 22/2794 useless extension candidates. Maximal degree in co-relation 3628. Up to 350 conditions per place. [2025-03-13 21:57:13,662 INFO L140 encePairwiseOnDemand]: 203/208 looper letters, 18 selfloop transitions, 3 changer transitions 0/213 dead transitions. [2025-03-13 21:57:13,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 213 transitions, 585 flow [2025-03-13 21:57:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 581 transitions. [2025-03-13 21:57:13,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9310897435897436 [2025-03-13 21:57:13,664 INFO L175 Difference]: Start difference. First operand has 193 places, 206 transitions, 526 flow. Second operand 3 states and 581 transitions. [2025-03-13 21:57:13,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 213 transitions, 585 flow [2025-03-13 21:57:13,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 213 transitions, 553 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:13,673 INFO L231 Difference]: Finished difference. Result has 194 places, 207 transitions, 511 flow [2025-03-13 21:57:13,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=511, PETRI_PLACES=194, PETRI_TRANSITIONS=207} [2025-03-13 21:57:13,674 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, -4 predicate places. [2025-03-13 21:57:13,674 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 207 transitions, 511 flow [2025-03-13 21:57:13,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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:13,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:13,675 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:13,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:57:13,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-13 21:57:13,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1112114566, now seen corresponding path program 1 times [2025-03-13 21:57:13,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:13,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729350928] [2025-03-13 21:57:13,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:13,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:13,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 21:57:13,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 21:57:13,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:13,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:14,248 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:14,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:14,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729350928] [2025-03-13 21:57:14,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729350928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:14,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:14,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:14,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449585249] [2025-03-13 21:57:14,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:14,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:14,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:14,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:14,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 208 [2025-03-13 21:57:14,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 207 transitions, 511 flow. Second operand has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 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:14,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:14,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 208 [2025-03-13 21:57:14,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:14,840 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][71], [Black: 208#true, Black: 215#(= ~top~0 0), 213#true, 93#L1023-1true, 109#L960true, 97#L1014true, 204#true, 217#true]) [2025-03-13 21:57:14,841 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-03-13 21:57:14,841 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-13 21:57:14,841 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-13 21:57:14,841 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 21:57:14,841 INFO L124 PetriNetUnfolderBase]: 556/4150 cut-off events. [2025-03-13 21:57:14,841 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-13 21:57:14,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5725 conditions, 4150 events. 556/4150 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 33533 event pairs, 211 based on Foata normal form. 0/3811 useless extension candidates. Maximal degree in co-relation 5356. Up to 771 conditions per place. [2025-03-13 21:57:14,857 INFO L140 encePairwiseOnDemand]: 197/208 looper letters, 35 selfloop transitions, 22 changer transitions 0/240 dead transitions. [2025-03-13 21:57:14,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 240 transitions, 699 flow [2025-03-13 21:57:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1114 transitions. [2025-03-13 21:57:14,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8926282051282052 [2025-03-13 21:57:14,861 INFO L175 Difference]: Start difference. First operand has 194 places, 207 transitions, 511 flow. Second operand 6 states and 1114 transitions. [2025-03-13 21:57:14,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 240 transitions, 699 flow [2025-03-13 21:57:14,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 240 transitions, 696 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:14,866 INFO L231 Difference]: Finished difference. Result has 203 places, 228 transitions, 658 flow [2025-03-13 21:57:14,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=658, PETRI_PLACES=203, PETRI_TRANSITIONS=228} [2025-03-13 21:57:14,867 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 5 predicate places. [2025-03-13 21:57:14,867 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 228 transitions, 658 flow [2025-03-13 21:57:14,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 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:14,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:14,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:14,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:57:14,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-13 21:57:14,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:14,869 INFO L85 PathProgramCache]: Analyzing trace with hash -594342464, now seen corresponding path program 1 times [2025-03-13 21:57:14,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:14,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194097811] [2025-03-13 21:57:14,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:14,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:14,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 21:57:14,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 21:57:14,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:14,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:14,920 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:14,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:14,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194097811] [2025-03-13 21:57:14,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194097811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:14,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:14,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:14,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039367829] [2025-03-13 21:57:14,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:14,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:14,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:14,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:14,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:14,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 208 [2025-03-13 21:57:14,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 228 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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:14,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:14,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 208 [2025-03-13 21:57:14,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:15,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][71], [Black: 221#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 219#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 222#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 208#true, 63#L999true, Black: 215#(= ~top~0 0), 93#L1023-1true, 97#L1014true, 228#true, 217#true, 204#true, Black: 220#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|))]) [2025-03-13 21:57:15,279 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2025-03-13 21:57:15,279 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-13 21:57:15,279 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-13 21:57:15,280 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-13 21:57:15,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][71], [146#L994true, Black: 221#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 219#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 222#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 208#true, Black: 215#(= ~top~0 0), 93#L1023-1true, 97#L1014true, 228#true, 217#true, 204#true, Black: 220#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|))]) [2025-03-13 21:57:15,289 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-13 21:57:15,289 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-13 21:57:15,289 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-13 21:57:15,289 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-13 21:57:15,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][71], [Black: 221#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 219#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 222#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 208#true, Black: 215#(= ~top~0 0), 96#L1025true, 97#L1014true, 228#true, 217#true, 204#true, Black: 220#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|))]) [2025-03-13 21:57:15,295 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2025-03-13 21:57:15,295 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-13 21:57:15,295 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-13 21:57:15,295 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-13 21:57:15,300 INFO L124 PetriNetUnfolderBase]: 521/4209 cut-off events. [2025-03-13 21:57:15,300 INFO L125 PetriNetUnfolderBase]: For 383/434 co-relation queries the response was YES. [2025-03-13 21:57:15,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6152 conditions, 4209 events. 521/4209 cut-off events. For 383/434 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 33212 event pairs, 173 based on Foata normal form. 15/3905 useless extension candidates. Maximal degree in co-relation 5823. Up to 786 conditions per place. [2025-03-13 21:57:15,316 INFO L140 encePairwiseOnDemand]: 199/208 looper letters, 32 selfloop transitions, 13 changer transitions 0/242 dead transitions. [2025-03-13 21:57:15,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 242 transitions, 796 flow [2025-03-13 21:57:15,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2025-03-13 21:57:15,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9086538461538461 [2025-03-13 21:57:15,317 INFO L175 Difference]: Start difference. First operand has 203 places, 228 transitions, 658 flow. Second operand 3 states and 567 transitions. [2025-03-13 21:57:15,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 242 transitions, 796 flow [2025-03-13 21:57:15,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 242 transitions, 796 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:57:15,324 INFO L231 Difference]: Finished difference. Result has 207 places, 239 transitions, 774 flow [2025-03-13 21:57:15,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=207, PETRI_TRANSITIONS=239} [2025-03-13 21:57:15,326 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 9 predicate places. [2025-03-13 21:57:15,326 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 239 transitions, 774 flow [2025-03-13 21:57:15,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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:15,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:15,326 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, 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:15,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:57:15,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-13 21:57:15,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash -579819280, now seen corresponding path program 1 times [2025-03-13 21:57:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110894047] [2025-03-13 21:57:15,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:15,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-13 21:57:15,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-13 21:57:15,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:15,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:15,425 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:15,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:15,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110894047] [2025-03-13 21:57:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110894047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:15,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:15,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:57:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139551447] [2025-03-13 21:57:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:15,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:15,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:15,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:15,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:15,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 208 [2025-03-13 21:57:15,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 239 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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:15,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:15,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 208 [2025-03-13 21:57:15,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:15,496 INFO L124 PetriNetUnfolderBase]: 33/703 cut-off events. [2025-03-13 21:57:15,497 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-13 21:57:15,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 703 events. 33/703 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3034 event pairs, 5 based on Foata normal form. 11/680 useless extension candidates. Maximal degree in co-relation 700. Up to 65 conditions per place. [2025-03-13 21:57:15,499 INFO L140 encePairwiseOnDemand]: 204/208 looper letters, 7 selfloop transitions, 4 changer transitions 0/186 dead transitions. [2025-03-13 21:57:15,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 186 transitions, 501 flow [2025-03-13 21:57:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 586 transitions. [2025-03-13 21:57:15,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391025641025641 [2025-03-13 21:57:15,501 INFO L175 Difference]: Start difference. First operand has 207 places, 239 transitions, 774 flow. Second operand 3 states and 586 transitions. [2025-03-13 21:57:15,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 186 transitions, 501 flow [2025-03-13 21:57:15,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 186 transitions, 427 flow, removed 23 selfloop flow, removed 14 redundant places. [2025-03-13 21:57:15,504 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 406 flow [2025-03-13 21:57:15,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2025-03-13 21:57:15,505 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, -12 predicate places. [2025-03-13 21:57:15,505 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 406 flow [2025-03-13 21:57:15,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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:15,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:15,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:57:15,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-13 21:57:15,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:15,507 INFO L85 PathProgramCache]: Analyzing trace with hash -997251830, now seen corresponding path program 1 times [2025-03-13 21:57:15,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:15,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177846526] [2025-03-13 21:57:15,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:15,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-13 21:57:15,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-13 21:57:15,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:15,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:15,559 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:15,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:15,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177846526] [2025-03-13 21:57:15,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177846526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:15,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:15,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:15,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900290790] [2025-03-13 21:57:15,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:15,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:15,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:15,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:15,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:15,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 208 [2025-03-13 21:57:15,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:15,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:15,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 208 [2025-03-13 21:57:15,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:15,662 INFO L124 PetriNetUnfolderBase]: 52/717 cut-off events. [2025-03-13 21:57:15,662 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-13 21:57:15,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 717 events. 52/717 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3346 event pairs, 28 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 679. Up to 119 conditions per place. [2025-03-13 21:57:15,665 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 22 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2025-03-13 21:57:15,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 184 transitions, 455 flow [2025-03-13 21:57:15,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 557 transitions. [2025-03-13 21:57:15,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8926282051282052 [2025-03-13 21:57:15,666 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 406 flow. Second operand 3 states and 557 transitions. [2025-03-13 21:57:15,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 184 transitions, 455 flow [2025-03-13 21:57:15,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 184 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:15,669 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 404 flow [2025-03-13 21:57:15,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2025-03-13 21:57:15,670 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, -12 predicate places. [2025-03-13 21:57:15,671 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 404 flow [2025-03-13 21:57:15,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:15,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:15,671 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:57:15,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-13 21:57:15,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:15,672 INFO L85 PathProgramCache]: Analyzing trace with hash 354387138, now seen corresponding path program 1 times [2025-03-13 21:57:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:15,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514421289] [2025-03-13 21:57:15,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:15,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:15,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-13 21:57:15,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-13 21:57:15,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:15,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:16,094 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:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514421289] [2025-03-13 21:57:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514421289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219032580] [2025-03-13 21:57:16,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:16,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:16,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:16,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:16,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 208 [2025-03-13 21:57:16,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 183 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 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:16,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:16,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 208 [2025-03-13 21:57:16,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:16,207 INFO L124 PetriNetUnfolderBase]: 51/713 cut-off events. [2025-03-13 21:57:16,207 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-13 21:57:16,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 713 events. 51/713 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3325 event pairs, 26 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 814. Up to 105 conditions per place. [2025-03-13 21:57:16,209 INFO L140 encePairwiseOnDemand]: 202/208 looper letters, 0 selfloop transitions, 0 changer transitions 186/186 dead transitions. [2025-03-13 21:57:16,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 186 transitions, 464 flow [2025-03-13 21:57:16,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2025-03-13 21:57:16,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766025641025641 [2025-03-13 21:57:16,211 INFO L175 Difference]: Start difference. First operand has 186 places, 183 transitions, 404 flow. Second operand 6 states and 1094 transitions. [2025-03-13 21:57:16,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 186 transitions, 464 flow [2025-03-13 21:57:16,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 186 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:16,213 INFO L231 Difference]: Finished difference. Result has 188 places, 0 transitions, 0 flow [2025-03-13 21:57:16,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=188, PETRI_TRANSITIONS=0} [2025-03-13 21:57:16,214 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, -10 predicate places. [2025-03-13 21:57:16,214 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 0 transitions, 0 flow [2025-03-13 21:57:16,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 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:16,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 24 remaining) [2025-03-13 21:57:16,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 24 remaining) [2025-03-13 21:57:16,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2025-03-13 21:57:16,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2025-03-13 21:57:16,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2025-03-13 21:57:16,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2025-03-13 21:57:16,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (17 of 24 remaining) [2025-03-13 21:57:16,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2025-03-13 21:57:16,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2025-03-13 21:57:16,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2025-03-13 21:57:16,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (13 of 24 remaining) [2025-03-13 21:57:16,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (12 of 24 remaining) [2025-03-13 21:57:16,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (11 of 24 remaining) [2025-03-13 21:57:16,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (10 of 24 remaining) [2025-03-13 21:57:16,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2025-03-13 21:57:16,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2025-03-13 21:57:16,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2025-03-13 21:57:16,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2025-03-13 21:57:16,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining) [2025-03-13 21:57:16,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2025-03-13 21:57:16,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2025-03-13 21:57:16,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2025-03-13 21:57:16,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining) [2025-03-13 21:57:16,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining) [2025-03-13 21:57:16,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:57:16,220 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:16,223 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:57:16,224 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:57:16,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:57:16 BasicIcfg [2025-03-13 21:57:16,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:57:16,229 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:57:16,229 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:57:16,229 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:57:16,230 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:12" (3/4) ... [2025-03-13 21:57:16,231 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:57:16,233 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-13 21:57:16,233 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-13 21:57:16,235 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-13 21:57:16,235 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 21:57:16,235 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 21:57:16,235 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 21:57:16,301 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:57:16,302 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:57:16,302 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:57:16,302 INFO L158 Benchmark]: Toolchain (without parser) took 4896.90ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 122.0MB in the beginning and 154.3MB in the end (delta: -32.3MB). Peak memory consumption was 186.3MB. Max. memory is 16.1GB. [2025-03-13 21:57:16,306 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:57:16,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.09ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 92.1MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-13 21:57:16,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.48ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 89.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:57:16,310 INFO L158 Benchmark]: Boogie Preprocessor took 31.97ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 88.3MB in the end (delta: 956.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:57:16,310 INFO L158 Benchmark]: IcfgBuilder took 386.37ms. Allocated memory is still 167.8MB. Free memory was 88.3MB in the beginning and 66.1MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:57:16,310 INFO L158 Benchmark]: TraceAbstraction took 3921.88ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 66.1MB in the beginning and 162.6MB in the end (delta: -96.6MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. [2025-03-13 21:57:16,310 INFO L158 Benchmark]: Witness Printer took 72.76ms. Allocated memory is still 385.9MB. Free memory was 162.6MB in the beginning and 154.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:57:16,311 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.45ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.09ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 92.1MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.48ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 89.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.97ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 88.3MB in the end (delta: 956.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 386.37ms. Allocated memory is still 167.8MB. Free memory was 88.3MB in the beginning and 66.1MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3921.88ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 66.1MB in the beginning and 162.6MB in the end (delta: -96.6MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. * Witness Printer took 72.76ms. Allocated memory is still 385.9MB. Free memory was 162.6MB in the beginning and 154.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 962]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 969]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 946]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 946]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1009]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 976]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 950]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 950]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 984]: 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, 354 locations, 24 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: 3.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 287 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 474 IncrementalHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 27 mSDtfsCounter, 474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=774occurred in iteration=4, 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, 1.3s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 951 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 21:57:16,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE