./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/n.c40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination 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/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/n.c40.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec147baa41deaa706a3db1972af791532e50c36ff3c23d3d92f8d6bea9417e65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:02:53,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:02:53,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:02:53,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:02:53,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:02:53,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:02:53,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:02:53,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:02:53,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:02:53,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:02:53,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:02:53,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:02:53,966 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:02:53,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:02:53,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:02:53,967 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:02:53,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:02:53,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:02:53,967 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:02:53,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:02:53,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:02:53,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:02:53,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:02:53,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:02:53,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:02:53,969 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:02:53,969 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> ec147baa41deaa706a3db1972af791532e50c36ff3c23d3d92f8d6bea9417e65 [2025-03-04 16:02:54,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:02:54,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:02:54,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:02:54,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:02:54,188 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:02:54,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/n.c40.c [2025-03-04 16:02:55,270 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eb4462f7/e98783267ede4d289a67011f06eca78a/FLAGcec1036c7 [2025-03-04 16:02:55,472 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:02:55,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/n.c40.c [2025-03-04 16:02:55,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eb4462f7/e98783267ede4d289a67011f06eca78a/FLAGcec1036c7 [2025-03-04 16:02:55,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eb4462f7/e98783267ede4d289a67011f06eca78a [2025-03-04 16:02:55,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:02:55,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:02:55,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:02:55,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:02:55,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:02:55,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575fa61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55, skipping insertion in model container [2025-03-04 16:02:55,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:02:55,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:02:55,604 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:02:55,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:02:55,636 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:02:55,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55 WrapperNode [2025-03-04 16:02:55,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:02:55,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:02:55,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:02:55,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:02:55,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,668 INFO L138 Inliner]: procedures = 12, calls = 223, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 252 [2025-03-04 16:02:55,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:02:55,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:02:55,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:02:55,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:02:55,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,693 INFO L175 MemorySlicer]: Split 215 memory accesses to 4 slices as follows [2, 8, 102, 103]. 48 percent of accesses are in the largest equivalence class. The 210 initializations are split as follows [2, 8, 100, 100]. The 2 writes are split as follows [0, 0, 0, 2]. [2025-03-04 16:02:55,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:02:55,718 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:02:55,718 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:02:55,718 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:02:55,718 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (1/1) ... [2025-03-04 16:02:55,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:55,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:55,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:02:55,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:02:55,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 16:02:55,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 16:02:55,812 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:02:55,813 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:02:56,019 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-03-04 16:02:56,019 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:02:56,024 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:02:56,025 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:02:56,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:02:56 BoogieIcfgContainer [2025-03-04 16:02:56,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:02:56,025 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:02:56,026 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:02:56,029 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:02:56,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:02:56,030 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:02:55" (1/3) ... [2025-03-04 16:02:56,030 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f79699c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:02:56, skipping insertion in model container [2025-03-04 16:02:56,031 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:02:56,031 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:02:55" (2/3) ... [2025-03-04 16:02:56,031 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f79699c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:02:56, skipping insertion in model container [2025-03-04 16:02:56,032 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:02:56,032 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:02:56" (3/3) ... [2025-03-04 16:02:56,034 INFO L363 chiAutomizerObserver]: Analyzing ICFG n.c40.c [2025-03-04 16:02:56,071 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:02:56,071 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:02:56,071 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:02:56,071 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:02:56,071 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:02:56,072 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:02:56,072 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:02:56,072 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:02:56,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 16:02:56,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 16:02:56,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:56,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:56,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:02:56,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:02:56,089 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:02:56,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 16:02:56,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 16:02:56,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:56,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:56,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:02:56,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:02:56,097 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(46, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(52, 2, 3, 1);call write~init~int#1(48, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(100, 4);~#x~0.base, ~#x~0.offset := 4, 0;call write~init~int#2(0, ~#x~0.base, ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 1 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 2 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 3 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 4 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 5 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 6 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 7 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 8 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 9 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 10 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 11 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 12 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 13 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 14 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 15 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 16 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 17 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 18 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 19 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 20 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 21 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 22 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 23 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 24 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 25 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 26 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 27 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 28 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 29 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 30 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 31 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 32 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 33 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 34 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 35 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 36 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 37 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 38 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 39 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 40 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 41 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 42 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 43 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 44 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 45 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 46 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 47 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 48 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 49 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 50 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 51 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 52 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 53 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 54 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 55 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 56 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 57 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 58 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 59 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 60 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 61 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 62 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 63 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 64 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 65 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 66 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 67 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 68 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 69 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 70 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 71 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 72 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 73 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 74 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 75 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 76 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 77 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 78 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 79 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 80 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 81 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 82 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 83 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 84 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 85 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 86 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 87 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 88 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 89 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 90 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 91 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 92 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 93 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 94 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 95 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 96 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 97 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 98 + ~#x~0.offset, 1);call write~init~int#2(0, ~#x~0.base, 99 + ~#x~0.offset, 1);call #Ultimate.allocInit(100, 5);~#y~0.base, ~#y~0.offset := 5, 0;call write~init~int#3(0, ~#y~0.base, ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 1 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 2 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 3 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 4 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 5 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 6 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 7 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 8 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 9 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 10 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 11 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 12 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 13 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 14 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 15 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 16 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 17 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 18 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 19 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 20 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 21 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 22 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 23 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 24 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 25 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 26 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 27 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 28 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 29 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 30 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 31 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 32 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 33 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 34 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 35 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 36 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 37 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 38 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 39 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 40 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 41 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 42 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 43 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 44 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 45 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 46 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 47 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 48 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 49 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 50 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 51 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 52 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 53 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 54 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 55 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 56 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 57 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 58 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 59 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 60 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 61 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 62 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 63 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 64 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 65 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 66 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 67 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 68 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 69 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 70 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 71 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 72 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 73 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 74 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 75 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 76 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 77 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 78 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 79 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 80 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 81 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 82 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 83 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 84 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 85 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 86 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 87 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 88 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 89 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 90 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 91 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 92 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 93 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 94 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 95 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 96 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 97 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 98 + ~#y~0.offset, 1);call write~init~int#3(0, ~#y~0.base, 99 + ~#y~0.offset, 1);~i~0 := 0;~j~0 := 0;~k~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1;havoc main_#t~nondet4#1;~k~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~i~0 := 0;" [2025-03-04 16:02:56,097 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem5#1 := read~int#2(~#x~0.base, ~#x~0.offset + ~i~0, 1);" "assume 0 != main_#t~mem5#1;havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#2(~#x~0.base, ~#x~0.offset + ~i~0, 1);call write~int#3(main_#t~mem6#1, ~#y~0.base, ~#y~0.offset + ~i~0, 1);havoc main_#t~mem6#1;main_#t~post7#1 := ~i~0;~i~0 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2025-03-04 16:02:56,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:56,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2025-03-04 16:02:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:56,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311108848] [2025-03-04 16:02:56,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:56,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:56,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:02:56,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:02:56,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:56,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:56,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:56,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:02:56,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:02:56,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:56,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:56,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:56,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:56,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 1 times [2025-03-04 16:02:56,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:56,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589323574] [2025-03-04 16:02:56,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:56,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:56,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:02:56,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:02:56,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:56,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:56,315 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:56,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:02:56,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:02:56,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:56,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:56,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:56,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:56,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1445791, now seen corresponding path program 1 times [2025-03-04 16:02:56,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:56,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3288627] [2025-03-04 16:02:56,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:56,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:56,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:02:56,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:02:56,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:56,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:56,710 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 16:02:56,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:56,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3288627] [2025-03-04 16:02:56,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3288627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:02:56,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:02:56,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:02:56,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454443277] [2025-03-04 16:02:56,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:02:56,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:56,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:02:56,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:02:56,825 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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 16:02:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:56,874 INFO L93 Difference]: Finished difference Result 10 states and 9 transitions. [2025-03-04 16:02:56,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 9 transitions. [2025-03-04 16:02:56,876 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:02:56,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2025-03-04 16:02:56,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:02:56,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:02:56,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:02:56,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:02:56,880 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:02:56,880 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:02:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:02:56,883 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:02:56,883 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:02:56,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 16:02:56,883 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:02:56,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 16:02:56,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:02:56 BoogieIcfgContainer [2025-03-04 16:02:56,892 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:02:56,893 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:02:56,894 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:02:56,894 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:02:56,894 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:02:56" (3/4) ... [2025-03-04 16:02:56,896 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 16:02:56,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:02:56,898 INFO L158 Benchmark]: Toolchain (without parser) took 1407.82ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 86.7MB in the end (delta: 43.6MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2025-03-04 16:02:56,898 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:02:56,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.20ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 117.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:02:56,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.49ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 114.8MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:02:56,899 INFO L158 Benchmark]: Boogie Preprocessor took 47.78ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 112.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:02:56,899 INFO L158 Benchmark]: IcfgBuilder took 307.34ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 90.6MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 16:02:56,899 INFO L158 Benchmark]: BuchiAutomizer took 867.10ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 86.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:02:56,899 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 167.8MB. Free memory was 86.7MB in the beginning and 86.7MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:02:56,900 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.20ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 117.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.49ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 114.8MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.78ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 112.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 307.34ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 90.6MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 867.10ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 86.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 167.8MB. Free memory was 86.7MB in the beginning and 86.7MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic). 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 5 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 16:02:56,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (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