./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed 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/termination-crafted/NestedRecursion_1a-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash d925f1aaa578011e84cee59af464c9f4e53ab5dc54b7f9269f34505d8383253a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:47:37,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:47:37,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:47:37,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:47:37,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:47:37,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:47:37,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:47:37,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:47:37,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:47:37,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:47:37,703 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:47:37,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:47:37,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:47:37,703 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:47:37,703 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:47:37,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:47:37,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:47:37,705 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:47:37,705 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:47:37,705 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:47:37,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:47:37,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:47:37,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:47:37,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:47:37,705 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:47:37,705 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d925f1aaa578011e84cee59af464c9f4e53ab5dc54b7f9269f34505d8383253a [2025-03-09 06:47:37,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:47:37,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:47:37,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:47:37,931 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:47:37,932 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:47:37,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c [2025-03-09 06:47:39,118 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0286495c/d339130061f743eeb3912bdcccab83eb/FLAG6214b2c43 [2025-03-09 06:47:39,320 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:47:39,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c [2025-03-09 06:47:39,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0286495c/d339130061f743eeb3912bdcccab83eb/FLAG6214b2c43 [2025-03-09 06:47:39,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0286495c/d339130061f743eeb3912bdcccab83eb [2025-03-09 06:47:39,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:47:39,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:47:39,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:47:39,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:47:39,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:47:39,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37455aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39, skipping insertion in model container [2025-03-09 06:47:39,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:47:39,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:47:39,793 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:47:39,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:47:39,812 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:47:39,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39 WrapperNode [2025-03-09 06:47:39,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:47:39,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:47:39,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:47:39,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:47:39,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,832 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 10 [2025-03-09 06:47:39,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:47:39,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:47:39,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:47:39,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:47:39,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,843 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 06:47:39,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:47:39,850 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:47:39,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:47:39,853 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:47:39,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (1/1) ... [2025-03-09 06:47:39,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:39,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:39,881 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-09 06:47:39,885 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-09 06:47:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2025-03-09 06:47:39,906 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2025-03-09 06:47:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2025-03-09 06:47:39,906 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2025-03-09 06:47:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:47:39,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:47:39,942 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:47:39,944 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:47:39,981 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14: havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; [2025-03-09 06:47:39,990 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: havoc #t~ret3;havoc #t~ret4; [2025-03-09 06:47:40,016 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-09 06:47:40,016 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:47:40,022 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:47:40,022 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:47:40,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:47:40 BoogieIcfgContainer [2025-03-09 06:47:40,023 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:47:40,023 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:47:40,023 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:47:40,027 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:47:40,027 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:47:40,028 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:47:39" (1/3) ... [2025-03-09 06:47:40,028 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c0de570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:47:40, skipping insertion in model container [2025-03-09 06:47:40,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:47:40,029 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:39" (2/3) ... [2025-03-09 06:47:40,029 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c0de570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:47:40, skipping insertion in model container [2025-03-09 06:47:40,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:47:40,029 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:47:40" (3/3) ... [2025-03-09 06:47:40,030 INFO L363 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1a-2.c [2025-03-09 06:47:40,073 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:47:40,073 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:47:40,073 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:47:40,073 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:47:40,074 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:47:40,074 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:47:40,074 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:47:40,074 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:47:40,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:47:40,091 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-09 06:47:40,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:40,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:40,096 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:47:40,096 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:47:40,096 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:47:40,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 06:47:40,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-09 06:47:40,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:40,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:40,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:47:40,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:47:40,103 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;havoc main_#t~nondet5#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !!(main_~x~0#1 <= 2147483646);" "call main_#t~ret6#1 := rec2(main_~x~0#1);"< [2025-03-09 06:47:40,103 INFO L754 eck$LassoCheckResult]: Loop: "~j := #in~j;" "assume !(~j <= 0);" "call #t~ret3 := rec1(1 + ~j);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#35#return;" "call #t~ret4 := rec2(#t~ret3);"< [2025-03-09 06:47:40,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:40,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1661326, now seen corresponding path program 1 times [2025-03-09 06:47:40,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:40,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668682346] [2025-03-09 06:47:40,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:40,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:40,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:40,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:40,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:40,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:40,161 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:40,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:40,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:40,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:40,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:40,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:40,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash -914940027, now seen corresponding path program 1 times [2025-03-09 06:47:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:40,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263552585] [2025-03-09 06:47:40,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:40,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:47:40,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:47:40,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:40,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:40,284 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-09 06:47:40,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:40,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263552585] [2025-03-09 06:47:40,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263552585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:47:40,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:47:40,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:47:40,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416292121] [2025-03-09 06:47:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:47:40,288 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:47:40,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:40,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:47:40,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:47:40,310 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 06:47:40,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:40,402 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2025-03-09 06:47:40,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2025-03-09 06:47:40,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-09 06:47:40,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 24 transitions. [2025-03-09 06:47:40,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-09 06:47:40,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-09 06:47:40,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2025-03-09 06:47:40,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:47:40,417 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-09 06:47:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2025-03-09 06:47:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-09 06:47:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-09 06:47:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-03-09 06:47:40,437 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-09 06:47:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:47:40,440 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-09 06:47:40,440 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:47:40,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2025-03-09 06:47:40,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-09 06:47:40,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:40,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:40,441 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:47:40,441 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:47:40,442 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;havoc main_#t~nondet5#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !!(main_~x~0#1 <= 2147483646);" "call main_#t~ret6#1 := rec2(main_~x~0#1);"< [2025-03-09 06:47:40,442 INFO L754 eck$LassoCheckResult]: Loop: "~j := #in~j;" "assume !(~j <= 0);" "call #t~ret3 := rec1(1 + ~j);"< "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#31#return;" "call #t~ret1 := rec1(#t~ret0 - 1);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#29#return;" "call #t~ret2 := rec1(#t~ret1);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#27#return;" "#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "call #t~ret4 := rec2(#t~ret3);"< [2025-03-09 06:47:40,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1661326, now seen corresponding path program 2 times [2025-03-09 06:47:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:40,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497913804] [2025-03-09 06:47:40,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:47:40,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:40,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:40,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:40,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:47:40,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:40,447 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:40,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:40,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:40,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:40,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:40,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:40,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1482246926, now seen corresponding path program 1 times [2025-03-09 06:47:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:40,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911158004] [2025-03-09 06:47:40,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:40,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:40,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:47:40,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:47:40,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:40,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:40,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:40,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:47:40,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:47:40,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:40,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:40,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:40,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:40,491 INFO L85 PathProgramCache]: Analyzing trace with hash -971016321, now seen corresponding path program 1 times [2025-03-09 06:47:40,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:40,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888894038] [2025-03-09 06:47:40,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:40,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 06:47:40,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:47:40,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:40,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:40,512 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:40,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 06:47:40,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:47:40,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:40,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:40,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:40,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:40,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:40,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:40,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:40,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:40,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:40,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:40,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:40,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:40,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:47:40 BoogieIcfgContainer [2025-03-09 06:47:40,854 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:47:40,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:47:40,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:47:40,855 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:47:40,855 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:47:40" (3/4) ... [2025-03-09 06:47:40,856 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-09 06:47:40,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:47:40,878 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:47:40,879 INFO L158 Benchmark]: Toolchain (without parser) took 1195.77ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 41.5MB in the end (delta: 71.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-09 06:47:40,879 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:40,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 129.84ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:47:40,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.15ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.7MB in the end (delta: 907.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:40,880 INFO L158 Benchmark]: Boogie Preprocessor took 16.46ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.8MB in the end (delta: 939.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:40,880 INFO L158 Benchmark]: IcfgBuilder took 172.57ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 90.0MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:47:40,880 INFO L158 Benchmark]: BuchiAutomizer took 830.77ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 44.4MB in the end (delta: 45.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-09 06:47:40,880 INFO L158 Benchmark]: Witness Printer took 24.03ms. Allocated memory is still 142.6MB. Free memory was 44.4MB in the beginning and 41.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:40,881 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.15ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 129.84ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 102.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.15ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.7MB in the end (delta: 907.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.46ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.8MB in the end (delta: 939.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 172.57ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 90.0MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 830.77ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 44.4MB in the end (delta: 45.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 24.03ms. Allocated memory is still 142.6MB. Free memory was 44.4MB in the beginning and 41.5MB in the end (delta: 3.0MB). 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) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.7s and 2 iterations. TraceHistogramMax:4. Analysis of lassos took 0.5s. 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 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. 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, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 27 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 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: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L24] int x = __VERIFIER_nondet_int(); [L26] COND FALSE !(!(x<=2147483646)) VAL [x=1] [L27] CALL rec2(x) VAL [\old(j)=1] Loop: [L18] COND FALSE !(j <= 0) [L20] CALL, EXPR rec1(j+1) [L12] COND FALSE !(i <= 0) [L14] CALL, EXPR rec1(i-2) [L12] COND TRUE i <= 0 [L13] return 0; [L14] RET, EXPR rec1(i-2) [L14] CALL, EXPR rec1(rec1(i-2) - 1) [L12] COND TRUE i <= 0 [L13] return 0; [L14] RET, EXPR rec1(rec1(i-2) - 1) [L14] CALL, EXPR rec1(rec1(rec1(i-2) - 1)) [L12] COND TRUE i <= 0 [L13] return 0; [L14] RET, EXPR rec1(rec1(rec1(i-2) - 1)) [L14] return rec1(rec1(rec1(i-2) - 1)) + 1; [L20] RET, EXPR rec1(j+1) [L20] CALL rec2(rec1(j+1)) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L24] int x = __VERIFIER_nondet_int(); [L26] COND FALSE !(!(x<=2147483646)) VAL [x=1] [L27] CALL rec2(x) VAL [\old(j)=1] Loop: [L18] COND FALSE !(j <= 0) [L20] CALL, EXPR rec1(j+1) [L12] COND FALSE !(i <= 0) [L14] CALL, EXPR rec1(i-2) [L12] COND TRUE i <= 0 [L13] return 0; [L14] RET, EXPR rec1(i-2) [L14] CALL, EXPR rec1(rec1(i-2) - 1) [L12] COND TRUE i <= 0 [L13] return 0; [L14] RET, EXPR rec1(rec1(i-2) - 1) [L14] CALL, EXPR rec1(rec1(rec1(i-2) - 1)) [L12] COND TRUE i <= 0 [L13] return 0; [L14] RET, EXPR rec1(rec1(rec1(i-2) - 1)) [L14] return rec1(rec1(rec1(i-2) - 1)) + 1; [L20] RET, EXPR rec1(j+1) [L20] CALL rec2(rec1(j+1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-09 06:47:40,892 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)