./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/dekker-unfair.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/dekker-unfair.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5850bf916a69badaacd3ff4150d219aedc42421ae90c33080aafb727bc040d43 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:01:51,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:01:51,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:01:51,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:01:51,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:01:51,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:01:51,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:01:51,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:01:51,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:01:51,329 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:01:51,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:01:51,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:01:51,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:01:51,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:01:51,330 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:01:51,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:01:51,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:01:51,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:01:51,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:01:51,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:01:51,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:01:51,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:01:51,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:01:51,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:01:51,331 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:01:51,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:01:51,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:01:51,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:01:51,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:01:51,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:01:51,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:01:51,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:01:51,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:01:51,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:01:51,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:01:51,333 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:01:51,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:01:51,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:01:51,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:01:51,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:01:51,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:01:51,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:01:51,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:01:51,333 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 ! call(reach_error())) ) 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 -> 5850bf916a69badaacd3ff4150d219aedc42421ae90c33080aafb727bc040d43 [2025-03-04 02:01:51,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:01:51,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:01:51,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:01:51,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:01:51,587 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:01:51,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/dekker-unfair.i [2025-03-04 02:01:52,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb5fa0d6/3a36d22e243344b1b4145d3f555d46e4/FLAG9f93fb4c3 [2025-03-04 02:01:53,044 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:01:53,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-unfair.i [2025-03-04 02:01:53,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb5fa0d6/3a36d22e243344b1b4145d3f555d46e4/FLAG9f93fb4c3 [2025-03-04 02:01:53,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb5fa0d6/3a36d22e243344b1b4145d3f555d46e4 [2025-03-04 02:01:53,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:01:53,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:01:53,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:01:53,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:01:53,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:01:53,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4c42be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53, skipping insertion in model container [2025-03-04 02:01:53,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:01:53,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-unfair.i[32921,32934] [2025-03-04 02:01:53,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-unfair.i[33157,33170] [2025-03-04 02:01:53,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:01:53,676 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:01:53,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-unfair.i[32921,32934] [2025-03-04 02:01:53,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-unfair.i[33157,33170] [2025-03-04 02:01:53,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:01:53,756 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:01:53,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53 WrapperNode [2025-03-04 02:01:53,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:01:53,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:01:53,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:01:53,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:01:53,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,787 INFO L138 Inliner]: procedures = 167, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2025-03-04 02:01:53,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:01:53,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:01:53,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:01:53,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:01:53,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,813 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:01:53,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,816 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:01:53,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:01:53,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:01:53,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:01:53,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (1/1) ... [2025-03-04 02:01:53,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:01:53,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:53,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:01:53,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:01:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-04 02:01:53,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-04 02:01:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 02:01:53,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 02:01:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:01:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:01:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:01:53,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:01:53,878 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:01:53,964 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:01:53,965 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:01:54,089 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:01:54,089 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:01:54,168 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:01:54,168 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:01:54,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:54 BoogieIcfgContainer [2025-03-04 02:01:54,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:01:54,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:01:54,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:01:54,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:01:54,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:01:53" (1/3) ... [2025-03-04 02:01:54,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a74c790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:01:54, skipping insertion in model container [2025-03-04 02:01:54,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:53" (2/3) ... [2025-03-04 02:01:54,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a74c790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:01:54, skipping insertion in model container [2025-03-04 02:01:54,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:54" (3/3) ... [2025-03-04 02:01:54,178 INFO L128 eAbstractionObserver]: Analyzing ICFG dekker-unfair.i [2025-03-04 02:01:54,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:01:54,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dekker-unfair.i that has 3 procedures, 37 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-03-04 02:01:54,195 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:01:54,234 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:01:54,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 44 transitions, 102 flow [2025-03-04 02:01:54,281 INFO L124 PetriNetUnfolderBase]: 8/42 cut-off events. [2025-03-04 02:01:54,283 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:01:54,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 42 events. 8/42 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 39. Up to 3 conditions per place. [2025-03-04 02:01:54,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 44 transitions, 102 flow [2025-03-04 02:01:54,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 40 transitions, 89 flow [2025-03-04 02:01:54,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:01:54,308 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;@28a6cfef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:01:54,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:01:54,322 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:01:54,324 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2025-03-04 02:01:54,324 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:01:54,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:54,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:54,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:01:54,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:54,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1363806542, now seen corresponding path program 1 times [2025-03-04 02:01:54,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:54,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103243489] [2025-03-04 02:01:54,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:54,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 02:01:54,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 02:01:54,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:54,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:54,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:54,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103243489] [2025-03-04 02:01:54,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103243489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:54,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:01:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678572651] [2025-03-04 02:01:54,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:54,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:01:54,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:54,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:01:54,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:01:54,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2025-03-04 02:01:54,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:54,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:54,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2025-03-04 02:01:54,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:54,755 INFO L124 PetriNetUnfolderBase]: 249/508 cut-off events. [2025-03-04 02:01:54,755 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 02:01:54,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 508 events. 249/508 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2613 event pairs, 86 based on Foata normal form. 63/547 useless extension candidates. Maximal degree in co-relation 899. Up to 233 conditions per place. [2025-03-04 02:01:54,762 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 28 selfloop transitions, 3 changer transitions 3/50 dead transitions. [2025-03-04 02:01:54,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 180 flow [2025-03-04 02:01:54,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:01:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:01:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-04 02:01:54,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2025-03-04 02:01:54,778 INFO L175 Difference]: Start difference. First operand has 39 places, 40 transitions, 89 flow. Second operand 3 states and 93 transitions. [2025-03-04 02:01:54,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 180 flow [2025-03-04 02:01:54,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 173 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:01:54,789 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 100 flow [2025-03-04 02:01:54,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-03-04 02:01:54,796 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2025-03-04 02:01:54,797 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 100 flow [2025-03-04 02:01:54,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:54,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:54,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:54,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:01:54,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:01:54,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash -447448076, now seen corresponding path program 1 times [2025-03-04 02:01:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405845349] [2025-03-04 02:01:54,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:54,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:01:54,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:01:54,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:54,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405845349] [2025-03-04 02:01:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405845349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:54,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:54,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:01:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033521241] [2025-03-04 02:01:54,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:54,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:01:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:54,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:01:54,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:01:54,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2025-03-04 02:01:54,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:54,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:54,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2025-03-04 02:01:54,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:54,995 INFO L124 PetriNetUnfolderBase]: 258/511 cut-off events. [2025-03-04 02:01:54,995 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-03-04 02:01:54,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 511 events. 258/511 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2498 event pairs, 108 based on Foata normal form. 25/514 useless extension candidates. Maximal degree in co-relation 805. Up to 299 conditions per place. [2025-03-04 02:01:54,999 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 25 selfloop transitions, 2 changer transitions 7/50 dead transitions. [2025-03-04 02:01:55,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 191 flow [2025-03-04 02:01:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:01:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:01:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-04 02:01:55,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-03-04 02:01:55,003 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 100 flow. Second operand 3 states and 90 transitions. [2025-03-04 02:01:55,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 191 flow [2025-03-04 02:01:55,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:01:55,005 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 104 flow [2025-03-04 02:01:55,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2025-03-04 02:01:55,006 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2025-03-04 02:01:55,006 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 104 flow [2025-03-04 02:01:55,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:55,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:55,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:55,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:01:55,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:01:55,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1685455688, now seen corresponding path program 1 times [2025-03-04 02:01:55,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:55,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375096776] [2025-03-04 02:01:55,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:55,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:01:55,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:01:55,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:55,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:55,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375096776] [2025-03-04 02:01:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375096776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:55,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:01:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054239445] [2025-03-04 02:01:55,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:55,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:01:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:55,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:01:55,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:01:55,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2025-03-04 02:01:55,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:55,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:55,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2025-03-04 02:01:55,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:55,137 INFO L124 PetriNetUnfolderBase]: 202/421 cut-off events. [2025-03-04 02:01:55,138 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-03-04 02:01:55,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 421 events. 202/421 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1965 event pairs, 95 based on Foata normal form. 8/397 useless extension candidates. Maximal degree in co-relation 587. Up to 201 conditions per place. [2025-03-04 02:01:55,140 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 24 selfloop transitions, 4 changer transitions 1/45 dead transitions. [2025-03-04 02:01:55,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 173 flow [2025-03-04 02:01:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:01:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:01:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-04 02:01:55,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2025-03-04 02:01:55,142 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 104 flow. Second operand 3 states and 89 transitions. [2025-03-04 02:01:55,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 173 flow [2025-03-04 02:01:55,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:01:55,145 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 104 flow [2025-03-04 02:01:55,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-03-04 02:01:55,146 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2025-03-04 02:01:55,146 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 104 flow [2025-03-04 02:01:55,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:55,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:55,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:55,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:01:55,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:01:55,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1114362218, now seen corresponding path program 2 times [2025-03-04 02:01:55,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:55,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768697639] [2025-03-04 02:01:55,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:55,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:55,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:01:55,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:01:55,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:01:55,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:55,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:55,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768697639] [2025-03-04 02:01:55,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768697639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:55,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:55,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:01:55,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011330537] [2025-03-04 02:01:55,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:55,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:01:55,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:55,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:01:55,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:01:55,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2025-03-04 02:01:55,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:55,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:55,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2025-03-04 02:01:55,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:55,279 INFO L124 PetriNetUnfolderBase]: 159/326 cut-off events. [2025-03-04 02:01:55,280 INFO L125 PetriNetUnfolderBase]: For 147/151 co-relation queries the response was YES. [2025-03-04 02:01:55,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 326 events. 159/326 cut-off events. For 147/151 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1344 event pairs, 60 based on Foata normal form. 6/296 useless extension candidates. Maximal degree in co-relation 366. Up to 149 conditions per place. [2025-03-04 02:01:55,281 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2025-03-04 02:01:55,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 188 flow [2025-03-04 02:01:55,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:01:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:01:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-04 02:01:55,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-03-04 02:01:55,283 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 104 flow. Second operand 3 states and 90 transitions. [2025-03-04 02:01:55,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 188 flow [2025-03-04 02:01:55,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 166 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 02:01:55,284 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2025-03-04 02:01:55,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=38, PETRI_TRANSITIONS=0} [2025-03-04 02:01:55,284 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2025-03-04 02:01:55,284 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2025-03-04 02:01:55,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:55,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-04 02:01:55,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-04 02:01:55,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-04 02:01:55,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-04 02:01:55,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-04 02:01:55,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-04 02:01:55,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:01:55,290 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-04 02:01:55,293 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:01:55,294 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:01:55,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:01:55 BasicIcfg [2025-03-04 02:01:55,299 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:01:55,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:01:55,300 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:01:55,301 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:01:55,301 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:54" (3/4) ... [2025-03-04 02:01:55,302 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:01:55,304 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-03-04 02:01:55,304 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-03-04 02:01:55,307 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2025-03-04 02:01:55,308 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 02:01:55,308 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 02:01:55,308 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 02:01:55,381 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:01:55,382 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:01:55,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:01:55,383 INFO L158 Benchmark]: Toolchain (without parser) took 2011.24ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 104.5MB in the end (delta: 514.4kB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2025-03-04 02:01:55,383 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory was 127.4MB in the beginning and 127.1MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:01:55,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.36ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 85.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:01:55,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.99ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:01:55,385 INFO L158 Benchmark]: Boogie Preprocessor took 31.40ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 82.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:01:55,385 INFO L158 Benchmark]: IcfgBuilder took 347.93ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 63.4MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:01:55,385 INFO L158 Benchmark]: TraceAbstraction took 1128.96ms. Allocated memory is still 142.6MB. Free memory was 62.4MB in the beginning and 37.7MB in the end (delta: 24.7MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2025-03-04 02:01:55,385 INFO L158 Benchmark]: Witness Printer took 82.59ms. Allocated memory is still 142.6MB. Free memory was 37.7MB in the beginning and 104.5MB in the end (delta: -66.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:01:55,386 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.22ms. Allocated memory is still 201.3MB. Free memory was 127.4MB in the beginning and 127.1MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.36ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 85.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.99ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.40ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 82.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 347.93ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 63.4MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1128.96ms. Allocated memory is still 142.6MB. Free memory was 62.4MB in the beginning and 37.7MB in the end (delta: 24.7MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * Witness Printer took 82.59ms. Allocated memory is still 142.6MB. Free memory was 37.7MB in the beginning and 104.5MB in the end (delta: -66.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 774]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 759]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 67 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 5 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 54 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:01:55,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE