./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-invariants/recursified_const.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/recursified_loop-invariants/recursified_const.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 df68cc134d4c89196adaa50333a41be4199690de58eaf3e6fbecc9a5100092fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:33:29,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:33:29,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:33:29,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:33:29,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:33:29,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:33:29,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:33:29,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:33:29,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:33:29,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:33:29,225 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:33:29,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:33:29,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:33:29,225 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:33:29,226 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:33:29,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:33:29,226 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:33:29,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:33:29,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:33:29,227 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:33:29,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:33:29,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:33:29,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:33:29,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:33:29,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:33:29,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:33:29,228 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:33:29,228 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 -> df68cc134d4c89196adaa50333a41be4199690de58eaf3e6fbecc9a5100092fe [2025-03-09 07:33:29,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:33:29,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:33:29,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:33:29,457 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:33:29,457 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:33:29,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-invariants/recursified_const.c [2025-03-09 07:33:30,581 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd53cbe0/ba94098cfc45478eb7fcf276d22274cb/FLAG5be01b490 [2025-03-09 07:33:30,794 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:33:30,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_const.c [2025-03-09 07:33:30,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd53cbe0/ba94098cfc45478eb7fcf276d22274cb/FLAG5be01b490 [2025-03-09 07:33:30,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd53cbe0/ba94098cfc45478eb7fcf276d22274cb [2025-03-09 07:33:30,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:33:30,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:33:30,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:33:30,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:33:30,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:33:30,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:30,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364ead45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30, skipping insertion in model container [2025-03-09 07:33:30,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:30,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:33:30,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:33:30,961 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:33:30,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:33:30,985 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:33:30,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30 WrapperNode [2025-03-09 07:33:30,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:33:30,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:33:30,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:33:30,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:33:30,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:30,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:31,010 INFO L138 Inliner]: procedures = 15, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2025-03-09 07:33:31,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:33:31,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:33:31,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:33:31,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:33:31,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:31,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:31,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:31,031 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 8, 5]. 53 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 8, 1]. The 1 writes are split as follows [0, 0, 1]. [2025-03-09 07:33:31,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:31,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:31,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:31,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:31,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:31,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:31,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:33:31,044 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:33:31,044 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:33:31,044 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:33:31,045 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (1/1) ... [2025-03-09 07:33:31,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:33:31,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:33:31,077 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 07:33:31,079 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 07:33:31,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:33:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_13_to_18_0 [2025-03-09 07:33:31,101 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_13_to_18_0 [2025-03-09 07:33:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:33:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 07:33:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 07:33:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 07:33:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 07:33:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 07:33:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 07:33:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:33:31,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:33:31,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 07:33:31,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 07:33:31,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 07:33:31,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 07:33:31,157 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:33:31,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:33:31,267 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L67: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-09 07:33:31,278 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-09 07:33:31,278 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:33:31,287 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:33:31,287 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:33:31,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:33:31 BoogieIcfgContainer [2025-03-09 07:33:31,289 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:33:31,289 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:33:31,290 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:33:31,293 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:33:31,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:33:31,294 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:33:30" (1/3) ... [2025-03-09 07:33:31,295 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cea790e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:33:31, skipping insertion in model container [2025-03-09 07:33:31,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:33:31,296 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:33:30" (2/3) ... [2025-03-09 07:33:31,296 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cea790e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:33:31, skipping insertion in model container [2025-03-09 07:33:31,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:33:31,296 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:33:31" (3/3) ... [2025-03-09 07:33:31,298 INFO L363 chiAutomizerObserver]: Analyzing ICFG recursified_const.c [2025-03-09 07:33:31,341 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:33:31,342 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:33:31,342 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:33:31,342 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:33:31,342 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:33:31,343 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:33:31,343 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:33:31,343 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:33:31,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 07:33:31,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-09 07:33:31,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:33:31,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:33:31,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 07:33:31,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:33:31,365 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:33:31,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 07:33:31,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-09 07:33:31,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:33:31,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:33:31,367 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 07:33:31,367 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:33:31,371 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(99, 2, 0, 1);call write~init~int#1(111, 2, 1, 1);call write~init~int#1(110, 2, 2, 1);call write~init~int#1(115, 2, 3, 1);call write~init~int#1(116, 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#s~0#1.base, main_~#s~0#1.offset;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(0, main_~#s~0#1.base, main_~#s~0#1.offset, 4);" "call func_to_recursive_line_13_to_18_0(main_~#s~0#1.base, main_~#s~0#1.offset);"< [2025-03-09 07:33:31,372 INFO L754 eck$LassoCheckResult]: Loop: "~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;havoc #t~nondet4#1;" "assume 0 != #t~nondet4#1 % 4294967296;havoc #t~nondet4#1;call #t~mem5#1 := read~int#2(~s#1.base, ~s#1.offset, 4);" "assume 0 != #t~mem5#1 % 4294967296;havoc #t~mem5#1;call #t~mem6#1 := read~int#2(~s#1.base, ~s#1.offset, 4);#t~pre7#1 := 1 + #t~mem6#1;call write~int#2(1 + #t~mem6#1, ~s#1.base, ~s#1.offset, 4);havoc #t~mem6#1;havoc #t~pre7#1;" "havoc #t~nondet8#1;" "assume !(0 != #t~nondet8#1 % 4294967296);havoc #t~nondet8#1;" "call func_to_recursive_line_13_to_18_0(~s#1.base, ~s#1.offset);"< [2025-03-09 07:33:31,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:33:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash 51610, now seen corresponding path program 1 times [2025-03-09 07:33:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:33:31,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030993998] [2025-03-09 07:33:31,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:33:31,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:33:31,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:33:31,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:33:31,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:33:31,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:33:31,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:33:31,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:33:31,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:33:31,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:33:31,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:33:31,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:33:31,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:33:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1299700878, now seen corresponding path program 1 times [2025-03-09 07:33:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:33:31,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554430627] [2025-03-09 07:33:31,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:33:31,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:33:31,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:33:31,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:33:31,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:33:31,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:33:31,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:33:31,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:33:31,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:33:31,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:33:31,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:33:31,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:33:31,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:33:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1349038233, now seen corresponding path program 1 times [2025-03-09 07:33:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:33:31,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171816179] [2025-03-09 07:33:31,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:33:31,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:33:31,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:33:31,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:33:31,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:33:31,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:33:31,872 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 07:33:31,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:33:31,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171816179] [2025-03-09 07:33:31,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171816179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:33:31,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:33:31,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 07:33:31,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151857827] [2025-03-09 07:33:31,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:33:32,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:33:32,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 07:33:32,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 07:33:32,111 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:33:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:33:32,186 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-03-09 07:33:32,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2025-03-09 07:33:32,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-09 07:33:32,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 11 states and 12 transitions. [2025-03-09 07:33:32,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 07:33:32,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 07:33:32,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2025-03-09 07:33:32,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:33:32,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-09 07:33:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2025-03-09 07:33:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-09 07:33:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:33:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-03-09 07:33:32,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-09 07:33:32,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 07:33:32,211 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-09 07:33:32,211 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:33:32,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2025-03-09 07:33:32,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-09 07:33:32,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:33:32,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:33:32,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 07:33:32,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:33:32,213 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(99, 2, 0, 1);call write~init~int#1(111, 2, 1, 1);call write~init~int#1(110, 2, 2, 1);call write~init~int#1(115, 2, 3, 1);call write~init~int#1(116, 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#s~0#1.base, main_~#s~0#1.offset;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(0, main_~#s~0#1.base, main_~#s~0#1.offset, 4);" "call func_to_recursive_line_13_to_18_0(main_~#s~0#1.base, main_~#s~0#1.offset);"< [2025-03-09 07:33:32,213 INFO L754 eck$LassoCheckResult]: Loop: "~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;havoc #t~nondet4#1;" "assume 0 != #t~nondet4#1 % 4294967296;havoc #t~nondet4#1;call #t~mem5#1 := read~int#2(~s#1.base, ~s#1.offset, 4);" "assume !(0 != #t~mem5#1 % 4294967296);havoc #t~mem5#1;" "havoc #t~nondet8#1;" "assume !(0 != #t~nondet8#1 % 4294967296);havoc #t~nondet8#1;" "call func_to_recursive_line_13_to_18_0(~s#1.base, ~s#1.offset);"< [2025-03-09 07:33:32,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:33:32,213 INFO L85 PathProgramCache]: Analyzing trace with hash 51610, now seen corresponding path program 2 times [2025-03-09 07:33:32,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:33:32,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141562750] [2025-03-09 07:33:32,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:33:32,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:33:32,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:33:32,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:33:32,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:33:32,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:33:32,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:33:32,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:33:32,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:33:32,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:33:32,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:33:32,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:33:32,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:33:32,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1299730669, now seen corresponding path program 1 times [2025-03-09 07:33:32,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:33:32,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803912633] [2025-03-09 07:33:32,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:33:32,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:33:32,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:33:32,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:33:32,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:33:32,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:33:32,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:33:32,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:33:32,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:33:32,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:33:32,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:33:32,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:33:32,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:33:32,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1349008442, now seen corresponding path program 1 times [2025-03-09 07:33:32,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:33:32,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338409720] [2025-03-09 07:33:32,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:33:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:33:32,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:33:32,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:33:32,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:33:32,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:33:32,261 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:33:32,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:33:32,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:33:32,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:33:32,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:33:32,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:33:32,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:33:32,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:33:32,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:33:32,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:33:32,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:33:32,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:33:32,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:33:32,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:33:32,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:33:32,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:33:32 BoogieIcfgContainer [2025-03-09 07:33:32,966 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:33:32,966 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:33:32,966 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:33:32,966 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:33:32,967 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:33:31" (3/4) ... [2025-03-09 07:33:32,969 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-09 07:33:32,995 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 07:33:32,996 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:33:32,997 INFO L158 Benchmark]: Toolchain (without parser) took 2167.70ms. Allocated memory is still 201.3MB. Free memory was 159.1MB in the beginning and 89.2MB in the end (delta: 69.9MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2025-03-09 07:33:32,998 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:33:32,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.99ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 148.6MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:33:32,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.50ms. Allocated memory is still 201.3MB. Free memory was 148.6MB in the beginning and 147.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:33:32,998 INFO L158 Benchmark]: Boogie Preprocessor took 31.02ms. Allocated memory is still 201.3MB. Free memory was 147.2MB in the beginning and 146.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:33:32,998 INFO L158 Benchmark]: IcfgBuilder took 245.11ms. Allocated memory is still 201.3MB. Free memory was 146.0MB in the beginning and 134.7MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 07:33:32,999 INFO L158 Benchmark]: BuchiAutomizer took 1676.37ms. Allocated memory is still 201.3MB. Free memory was 134.4MB in the beginning and 92.5MB in the end (delta: 41.9MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2025-03-09 07:33:32,999 INFO L158 Benchmark]: Witness Printer took 29.53ms. Allocated memory is still 201.3MB. Free memory was 91.5MB in the beginning and 89.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:33:33,000 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.20ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.99ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 148.6MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.50ms. Allocated memory is still 201.3MB. Free memory was 148.6MB in the beginning and 147.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.02ms. Allocated memory is still 201.3MB. Free memory was 147.2MB in the beginning and 146.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 245.11ms. Allocated memory is still 201.3MB. Free memory was 146.0MB in the beginning and 134.7MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1676.37ms. Allocated memory is still 201.3MB. Free memory was 134.4MB in the beginning and 92.5MB in the end (delta: 41.9MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * Witness Printer took 29.53ms. Allocated memory is still 201.3MB. Free memory was 91.5MB in the beginning and 89.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. 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 6 locations. The remainder module has 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. 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, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 13 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 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: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 38]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L67] unsigned int s = 0; [L67] unsigned int s = 0; [L68] CALL func_to_recursive_line_13_to_18_0(&s) Loop: [L40] COND TRUE __VERIFIER_nondet_uint() [L43] EXPR \read(*s) [L43] COND FALSE !((*s) != 0) [L50] COND FALSE !(__VERIFIER_nondet_uint()) [L58] CALL func_to_recursive_line_13_to_18_0(s) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 38]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L67] unsigned int s = 0; [L67] unsigned int s = 0; [L68] CALL func_to_recursive_line_13_to_18_0(&s) Loop: [L40] COND TRUE __VERIFIER_nondet_uint() [L43] EXPR \read(*s) [L43] COND FALSE !((*s) != 0) [L50] COND FALSE !(__VERIFIER_nondet_uint()) [L58] CALL func_to_recursive_line_13_to_18_0(s) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-09 07:33:33,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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)