./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.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 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:19:35,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:19:35,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:19:35,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:19:35,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:19:35,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:19:35,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:19:35,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:19:35,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:19:35,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:19:35,925 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:19:35,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:19:35,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:19:35,925 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:19:35,927 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:19:35,927 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:19:35,927 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:19:35,927 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:19:35,927 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:19:35,927 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:19:35,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:19:35,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:19:35,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:19:35,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:19:35,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:19:35,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:19:35,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:19:35,929 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:19:35,929 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 -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2025-03-04 16:19:36,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:19:36,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:19:36,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:19:36,125 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:19:36,125 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:19:36,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2025-03-04 16:19:37,270 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c2b3b189/184b13a01e7a43518ac60d5b1eba71ad/FLAGb7fce7128 [2025-03-04 16:19:37,504 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:19:37,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2025-03-04 16:19:37,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c2b3b189/184b13a01e7a43518ac60d5b1eba71ad/FLAGb7fce7128 [2025-03-04 16:19:37,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c2b3b189/184b13a01e7a43518ac60d5b1eba71ad [2025-03-04 16:19:37,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:19:37,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:19:37,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:19:37,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:19:37,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:19:37,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680c9047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37, skipping insertion in model container [2025-03-04 16:19:37,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:19:37,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:19:37,662 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:19:37,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:19:37,691 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:19:37,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37 WrapperNode [2025-03-04 16:19:37,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:19:37,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:19:37,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:19:37,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:19:37,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,716 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2025-03-04 16:19:37,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:19:37,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:19:37,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:19:37,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:19:37,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,742 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2025-03-04 16:19:37,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,748 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:19:37,757 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:19:37,757 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:19:37,757 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:19:37,757 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (1/1) ... [2025-03-04 16:19:37,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:19:37,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:37,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:19:37,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 16:19:37,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:19:37,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:19:37,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 16:19:37,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-03-04 16:19:37,800 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-03-04 16:19:37,800 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2025-03-04 16:19:37,800 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2025-03-04 16:19:37,800 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:19:37,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 16:19:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 16:19:37,866 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:19:37,867 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:19:38,038 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset; [2025-03-04 16:19:38,059 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 16:19:38,061 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:19:38,069 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:19:38,071 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:19:38,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:19:38 BoogieIcfgContainer [2025-03-04 16:19:38,071 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:19:38,072 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:19:38,072 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:19:38,076 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:19:38,077 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:19:38,077 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:19:37" (1/3) ... [2025-03-04 16:19:38,078 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69936003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:19:38, skipping insertion in model container [2025-03-04 16:19:38,079 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:19:38,079 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:37" (2/3) ... [2025-03-04 16:19:38,079 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69936003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:19:38, skipping insertion in model container [2025-03-04 16:19:38,079 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:19:38,079 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:19:38" (3/3) ... [2025-03-04 16:19:38,080 INFO L363 chiAutomizerObserver]: Analyzing ICFG recursified_nested_4.c [2025-03-04 16:19:38,114 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:19:38,114 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:19:38,114 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:19:38,115 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:19:38,115 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:19:38,115 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:19:38,115 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:19:38,115 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:19:38,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 16:19:38,131 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:38,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:38,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:38,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:38,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:38,134 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:19:38,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 16:19:38,137 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:38,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:38,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:38,137 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:38,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:38,141 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);"< [2025-03-04 16:19:38,141 INFO L754 eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);"< [2025-03-04 16:19:38,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:38,145 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 1 times [2025-03-04 16:19:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:38,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566320090] [2025-03-04 16:19:38,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:38,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:38,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:38,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:38,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:38,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:38,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:38,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:38,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:38,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:38,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:38,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:38,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:38,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2100655605, now seen corresponding path program 1 times [2025-03-04 16:19:38,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:38,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337120816] [2025-03-04 16:19:38,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:38,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:38,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:19:38,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:19:38,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:38,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:19:38,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:38,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337120816] [2025-03-04 16:19:38,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337120816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:19:38,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:19:38,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:19:38,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204855861] [2025-03-04 16:19:38,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:19:38,596 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:38,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:19:38,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:19:38,618 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-04 16:19:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:38,774 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2025-03-04 16:19:38,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2025-03-04 16:19:38,776 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:38,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 29 states and 35 transitions. [2025-03-04 16:19:38,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-04 16:19:38,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-03-04 16:19:38,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2025-03-04 16:19:38,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:38,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 16:19:38,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2025-03-04 16:19:38,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-04 16:19:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 16:19:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-04 16:19:38,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 16:19:38,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:19:38,809 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 16:19:38,809 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:19:38,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2025-03-04 16:19:38,809 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:38,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:38,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:38,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:38,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:38,811 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);"< [2025-03-04 16:19:38,811 INFO L754 eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#51#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);"< [2025-03-04 16:19:38,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:38,812 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 2 times [2025-03-04 16:19:38,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:38,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659138018] [2025-03-04 16:19:38,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:19:38,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:38,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:38,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:38,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:19:38,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:38,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:38,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:38,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:38,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:38,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:38,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:38,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:38,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1206602643, now seen corresponding path program 1 times [2025-03-04 16:19:38,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:38,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64148723] [2025-03-04 16:19:38,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:38,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:19:38,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:19:38,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:38,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:39,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 16:19:39,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:39,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64148723] [2025-03-04 16:19:39,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64148723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:19:39,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:19:39,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:19:39,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007077734] [2025-03-04 16:19:39,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:19:39,075 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:39,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:39,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:19:39,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:19:39,076 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 16:19:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:39,174 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-03-04 16:19:39,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2025-03-04 16:19:39,174 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:39,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 37 transitions. [2025-03-04 16:19:39,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-03-04 16:19:39,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-03-04 16:19:39,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2025-03-04 16:19:39,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:39,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-04 16:19:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2025-03-04 16:19:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 16:19:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 16:19:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-04 16:19:39,178 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-04 16:19:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:19:39,179 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-04 16:19:39,179 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:19:39,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2025-03-04 16:19:39,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:39,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:39,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:39,180 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:39,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:39,180 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);"< [2025-03-04 16:19:39,180 INFO L754 eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#51#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);"< [2025-03-04 16:19:39,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:39,181 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 3 times [2025-03-04 16:19:39,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:39,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044623845] [2025-03-04 16:19:39,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:19:39,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:39,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:39,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:39,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:19:39,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:39,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:39,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:39,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:39,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:39,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:39,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:39,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:39,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1018977426, now seen corresponding path program 1 times [2025-03-04 16:19:39,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:39,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159957135] [2025-03-04 16:19:39,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:39,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:39,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 16:19:39,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 16:19:39,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:39,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 16:19:39,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:39,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159957135] [2025-03-04 16:19:39,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159957135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:19:39,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:19:39,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:19:39,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857483394] [2025-03-04 16:19:39,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:19:39,383 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:39,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:39,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:19:39,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:19:39,384 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 16:19:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:39,440 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-03-04 16:19:39,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2025-03-04 16:19:39,441 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:39,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2025-03-04 16:19:39,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-03-04 16:19:39,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-03-04 16:19:39,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2025-03-04 16:19:39,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:39,442 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-03-04 16:19:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2025-03-04 16:19:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-04 16:19:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 22 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-04 16:19:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-03-04 16:19:39,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-03-04 16:19:39,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:19:39,445 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-03-04 16:19:39,445 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:19:39,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2025-03-04 16:19:39,446 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:39,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:39,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:39,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:39,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:39,447 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);"< [2025-03-04 16:19:39,447 INFO L754 eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#51#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);"< [2025-03-04 16:19:39,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:39,447 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 4 times [2025-03-04 16:19:39,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:39,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879361696] [2025-03-04 16:19:39,448 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:19:39,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:39,455 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 16:19:39,467 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:39,467 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:19:39,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:39,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:39,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:39,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:39,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:39,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:39,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:39,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash -800542714, now seen corresponding path program 1 times [2025-03-04 16:19:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:39,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943457511] [2025-03-04 16:19:39,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:39,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 16:19:39,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 16:19:39,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:39,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 16:19:39,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:39,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943457511] [2025-03-04 16:19:39,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943457511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:39,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045542864] [2025-03-04 16:19:39,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:39,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:39,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:39,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:39,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 16:19:39,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 16:19:39,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 16:19:39,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:39,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:39,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 16:19:39,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:40,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 16:19:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 16:19:40,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 16:19:40,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045542864] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:40,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:40,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2025-03-04 16:19:40,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42873970] [2025-03-04 16:19:40,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:40,651 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:40,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:40,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 16:19:40,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-03-04 16:19:40,652 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand has 22 states, 16 states have (on average 2.375) internal successors, (38), 19 states have internal predecessors, (38), 8 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 16:19:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:40,839 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-04 16:19:40,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2025-03-04 16:19:40,840 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:40,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 43 transitions. [2025-03-04 16:19:40,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-04 16:19:40,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-04 16:19:40,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2025-03-04 16:19:40,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:40,841 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-04 16:19:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2025-03-04 16:19:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-04 16:19:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 16:19:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-04 16:19:40,843 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-04 16:19:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 16:19:40,844 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-04 16:19:40,844 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:19:40,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2025-03-04 16:19:40,844 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:40,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:40,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:40,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:40,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:40,845 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);"< [2025-03-04 16:19:40,845 INFO L754 eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#51#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);"< [2025-03-04 16:19:40,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 5 times [2025-03-04 16:19:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197896157] [2025-03-04 16:19:40,846 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:19:40,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:40,851 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:40,855 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:40,855 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:19:40,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:40,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:40,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:40,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:40,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:40,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:40,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:40,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:40,865 INFO L85 PathProgramCache]: Analyzing trace with hash 212643146, now seen corresponding path program 2 times [2025-03-04 16:19:40,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:40,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095974733] [2025-03-04 16:19:40,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:19:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:40,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 16:19:40,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 16:19:40,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:19:40,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:41,530 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 16:19:41,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:41,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095974733] [2025-03-04 16:19:41,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095974733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:41,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093276448] [2025-03-04 16:19:41,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:19:41,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:41,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:41,533 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:41,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 16:19:41,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 16:19:41,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 16:19:41,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:19:41,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:41,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 16:19:41,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:41,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 16:19:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 16:19:41,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 16:19:42,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093276448] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:42,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:42,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 28 [2025-03-04 16:19:42,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883659701] [2025-03-04 16:19:42,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:42,232 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:42,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:42,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 16:19:42,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2025-03-04 16:19:42,233 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. cyclomatic complexity: 10 Second operand has 28 states, 21 states have (on average 2.238095238095238) internal successors, (47), 24 states have internal predecessors, (47), 11 states have call successors, (16), 6 states have call predecessors, (16), 10 states have return successors, (16), 9 states have call predecessors, (16), 11 states have call successors, (16) [2025-03-04 16:19:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:42,666 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-03-04 16:19:42,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2025-03-04 16:19:42,667 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:42,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 47 transitions. [2025-03-04 16:19:42,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-03-04 16:19:42,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-03-04 16:19:42,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2025-03-04 16:19:42,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:42,670 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-03-04 16:19:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2025-03-04 16:19:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-04 16:19:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 10 states have return successors, (13), 10 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-04 16:19:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-03-04 16:19:42,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-03-04 16:19:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 16:19:42,674 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-03-04 16:19:42,674 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:19:42,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2025-03-04 16:19:42,674 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:42,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:42,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:42,676 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:42,676 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:42,676 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);"< [2025-03-04 16:19:42,676 INFO L754 eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#51#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);"< [2025-03-04 16:19:42,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 6 times [2025-03-04 16:19:42,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:42,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395177584] [2025-03-04 16:19:42,677 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:19:42,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:42,681 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:42,696 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:42,696 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 16:19:42,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:42,697 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:42,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:42,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:42,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:42,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:42,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:42,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1771885185, now seen corresponding path program 3 times [2025-03-04 16:19:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:42,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932159228] [2025-03-04 16:19:42,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:19:42,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:42,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 8 equivalence classes. [2025-03-04 16:19:42,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 82 statements. [2025-03-04 16:19:42,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 16:19:42,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-04 16:19:42,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:42,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932159228] [2025-03-04 16:19:42,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932159228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:42,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913376311] [2025-03-04 16:19:42,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:19:42,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:42,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:42,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:42,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 16:19:42,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 8 equivalence classes. [2025-03-04 16:19:42,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 82 statements. [2025-03-04 16:19:42,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 16:19:42,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:43,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 16:19:43,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:43,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:19:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-04 16:19:43,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-04 16:19:43,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913376311] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:43,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:43,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 22 [2025-03-04 16:19:43,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922119925] [2025-03-04 16:19:43,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:43,472 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:43,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:43,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 16:19:43,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-04 16:19:43,472 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. cyclomatic complexity: 10 Second operand has 22 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 19 states have internal predecessors, (33), 10 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 16:19:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:43,695 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-04 16:19:43,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2025-03-04 16:19:43,696 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:43,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 51 transitions. [2025-03-04 16:19:43,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-03-04 16:19:43,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-03-04 16:19:43,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2025-03-04 16:19:43,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:43,697 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-03-04 16:19:43,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2025-03-04 16:19:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 16:19:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 12 states have return successors, (15), 12 states have call predecessors, (15), 6 states have call successors, (15) [2025-03-04 16:19:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-03-04 16:19:43,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-03-04 16:19:43,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 16:19:43,701 INFO L432 stractBuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-03-04 16:19:43,701 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:19:43,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2025-03-04 16:19:43,701 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:43,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:43,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:43,704 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:43,704 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 24, 24, 24, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:43,704 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);"< [2025-03-04 16:19:43,704 INFO L754 eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);"< [2025-03-04 16:19:43,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 7 times [2025-03-04 16:19:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:43,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976592237] [2025-03-04 16:19:43,705 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 16:19:43,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:43,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:43,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:43,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:43,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:43,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:43,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:43,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:43,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:43,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:43,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:43,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:43,722 INFO L85 PathProgramCache]: Analyzing trace with hash 344482635, now seen corresponding path program 4 times [2025-03-04 16:19:43,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:43,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624400857] [2025-03-04 16:19:43,722 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:19:43,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:43,745 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 228 statements into 2 equivalence classes. [2025-03-04 16:19:43,789 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 16:19:43,789 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 16:19:43,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2238 backedges. 16 proven. 635 refuted. 0 times theorem prover too weak. 1587 trivial. 0 not checked. [2025-03-04 16:19:45,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624400857] [2025-03-04 16:19:45,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624400857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876711134] [2025-03-04 16:19:45,633 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:19:45,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:45,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:45,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:45,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 16:19:45,728 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 228 statements into 2 equivalence classes. [2025-03-04 16:19:45,836 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 16:19:45,836 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 16:19:45,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:45,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-04 16:19:45,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:45,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 16:19:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2238 backedges. 683 proven. 27 refuted. 0 times theorem prover too weak. 1528 trivial. 0 not checked. [2025-03-04 16:19:46,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2238 backedges. 633 proven. 46 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2025-03-04 16:19:48,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876711134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:48,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:48,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 22] total 41 [2025-03-04 16:19:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074945606] [2025-03-04 16:19:48,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:48,685 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:48,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 16:19:48,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1337, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 16:19:48,686 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 10 Second operand has 41 states, 31 states have (on average 2.096774193548387) internal successors, (65), 35 states have internal predecessors, (65), 14 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (34), 13 states have call predecessors, (34), 14 states have call successors, (34) [2025-03-04 16:19:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:49,039 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-03-04 16:19:49,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2025-03-04 16:19:49,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:49,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 55 transitions. [2025-03-04 16:19:49,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-03-04 16:19:49,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-03-04 16:19:49,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2025-03-04 16:19:49,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:49,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2025-03-04 16:19:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2025-03-04 16:19:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 16:19:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 30 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 14 states have return successors, (17), 14 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-04 16:19:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2025-03-04 16:19:49,044 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2025-03-04 16:19:49,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 16:19:49,046 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2025-03-04 16:19:49,046 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 16:19:49,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 55 transitions. [2025-03-04 16:19:49,046 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:49,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:49,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:49,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:49,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:49,048 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);"< [2025-03-04 16:19:49,049 INFO L754 eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);"< [2025-03-04 16:19:49,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 8 times [2025-03-04 16:19:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:49,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562370029] [2025-03-04 16:19:49,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:19:49,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:49,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:49,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:49,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:19:49,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:49,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:49,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:49,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:49,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:49,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:49,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:49,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash 598843595, now seen corresponding path program 5 times [2025-03-04 16:19:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:49,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835618574] [2025-03-04 16:19:49,063 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:19:49,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:49,086 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 288 statements into 12 equivalence classes. [2025-03-04 16:19:49,309 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 268 of 288 statements. [2025-03-04 16:19:49,309 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-04 16:19:49,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 63 proven. 59 refuted. 0 times theorem prover too weak. 4174 trivial. 0 not checked. [2025-03-04 16:19:50,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:50,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835618574] [2025-03-04 16:19:50,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835618574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:50,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358072564] [2025-03-04 16:19:50,270 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:19:50,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:50,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:50,272 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:50,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 16:19:50,403 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 288 statements into 12 equivalence classes. [2025-03-04 16:19:53,392 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 268 of 288 statements. [2025-03-04 16:19:53,392 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-04 16:19:53,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:53,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 1526 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 16:19:53,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:53,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 16:19:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 2015 proven. 8 refuted. 0 times theorem prover too weak. 2273 trivial. 0 not checked. [2025-03-04 16:19:53,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 59 proven. 66 refuted. 0 times theorem prover too weak. 4171 trivial. 0 not checked. [2025-03-04 16:19:54,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358072564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:54,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:54,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 29 [2025-03-04 16:19:54,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414385865] [2025-03-04 16:19:54,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:54,743 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:54,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:54,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 16:19:54,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2025-03-04 16:19:54,744 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. cyclomatic complexity: 10 Second operand has 29 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 25 states have internal predecessors, (62), 14 states have call successors, (25), 6 states have call predecessors, (25), 9 states have return successors, (26), 11 states have call predecessors, (26), 14 states have call successors, (26) [2025-03-04 16:19:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:54,963 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2025-03-04 16:19:54,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 59 transitions. [2025-03-04 16:19:54,964 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:54,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 59 transitions. [2025-03-04 16:19:54,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-03-04 16:19:54,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-03-04 16:19:54,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 59 transitions. [2025-03-04 16:19:54,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:54,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-03-04 16:19:54,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 59 transitions. [2025-03-04 16:19:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 16:19:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.103448275862069) internal successors, (32), 32 states have internal predecessors, (32), 8 states have call successors, (8), 4 states have call predecessors, (8), 16 states have return successors, (19), 16 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-04 16:19:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-03-04 16:19:54,968 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-03-04 16:19:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 16:19:54,969 INFO L432 stractBuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-03-04 16:19:54,969 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 16:19:54,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 59 transitions. [2025-03-04 16:19:54,969 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:54,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:54,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:54,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:54,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [84, 84, 72, 72, 72, 15, 15, 12, 12, 12, 12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:54,973 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);"< [2025-03-04 16:19:54,973 INFO L754 eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);"< [2025-03-04 16:19:54,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:54,973 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 9 times [2025-03-04 16:19:54,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:54,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233580989] [2025-03-04 16:19:54,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:19:54,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:54,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:54,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:54,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:19:54,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:54,983 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:54,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:54,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:54,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:54,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:54,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:54,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:54,991 INFO L85 PathProgramCache]: Analyzing trace with hash -130987107, now seen corresponding path program 6 times [2025-03-04 16:19:54,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:54,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809647404] [2025-03-04 16:19:54,991 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:19:54,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:55,028 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 534 statements into 23 equivalence classes. [2025-03-04 16:19:55,057 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 92 of 534 statements. [2025-03-04 16:19:55,057 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-04 16:19:55,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 17127 trivial. 0 not checked. [2025-03-04 16:19:55,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:55,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809647404] [2025-03-04 16:19:55,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809647404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:55,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350717647] [2025-03-04 16:19:55,527 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:19:55,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:55,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:55,529 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:55,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 16:19:55,718 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 534 statements into 23 equivalence classes. [2025-03-04 16:19:55,789 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 92 of 534 statements. [2025-03-04 16:19:55,789 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-04 16:19:55,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:55,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 16:19:55,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:55,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:19:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 17136 trivial. 0 not checked. [2025-03-04 16:19:55,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 17118 trivial. 0 not checked. [2025-03-04 16:19:57,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350717647] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:57,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:57,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 18] total 34 [2025-03-04 16:19:57,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804122342] [2025-03-04 16:19:57,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:57,718 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:57,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:57,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 16:19:57,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 16:19:57,719 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. cyclomatic complexity: 10 Second operand has 34 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 29 states have internal predecessors, (46), 15 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-04 16:19:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:58,148 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2025-03-04 16:19:58,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 63 transitions. [2025-03-04 16:19:58,149 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:58,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 63 transitions. [2025-03-04 16:19:58,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-03-04 16:19:58,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-03-04 16:19:58,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 63 transitions. [2025-03-04 16:19:58,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:58,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 63 transitions. [2025-03-04 16:19:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 63 transitions. [2025-03-04 16:19:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-04 16:19:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.096774193548387) internal successors, (34), 34 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 18 states have return successors, (21), 18 states have call predecessors, (21), 6 states have call successors, (21) [2025-03-04 16:19:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2025-03-04 16:19:58,156 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 63 transitions. [2025-03-04 16:19:58,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 16:19:58,158 INFO L432 stractBuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2025-03-04 16:19:58,158 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 16:19:58,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 63 transitions. [2025-03-04 16:19:58,159 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:19:58,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:58,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:58,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:58,165 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [140, 140, 120, 120, 120, 25, 25, 20, 20, 20, 20, 20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:58,166 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);"< [2025-03-04 16:19:58,166 INFO L754 eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);"< [2025-03-04 16:19:58,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:58,168 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 10 times [2025-03-04 16:19:58,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:58,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243065683] [2025-03-04 16:19:58,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:19:58,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:58,173 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 16:19:58,176 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:58,176 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:19:58,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:58,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:58,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:58,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:58,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:58,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:58,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:58,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:58,184 INFO L85 PathProgramCache]: Analyzing trace with hash -948469079, now seen corresponding path program 7 times [2025-03-04 16:19:58,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:58,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423841524] [2025-03-04 16:19:58,184 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 16:19:58,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:58,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 884 statements into 1 equivalence classes. [2025-03-04 16:19:58,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 884 of 884 statements. [2025-03-04 16:19:58,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:58,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 47920 backedges. 22 proven. 628 refuted. 0 times theorem prover too weak. 47270 trivial. 0 not checked. [2025-03-04 16:20:03,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:20:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423841524] [2025-03-04 16:20:03,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423841524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:20:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022528509] [2025-03-04 16:20:03,441 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 16:20:03,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:20:03,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:03,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:20:03,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 16:20:03,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 884 statements into 1 equivalence classes. [2025-03-04 16:20:04,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 884 of 884 statements. [2025-03-04 16:20:04,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:04,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:04,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 5044 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-04 16:20:04,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:04,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 16:20:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 47920 backedges. 614 proven. 24 refuted. 0 times theorem prover too weak. 47282 trivial. 0 not checked. [2025-03-04 16:20:04,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:20:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 47920 backedges. 614 proven. 58 refuted. 0 times theorem prover too weak. 47248 trivial. 0 not checked. [2025-03-04 16:20:08,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022528509] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:20:08,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:20:08,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 22] total 40 [2025-03-04 16:20:08,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861478255] [2025-03-04 16:20:08,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:20:08,553 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:20:08,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:20:08,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 16:20:08,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 16:20:08,555 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. cyclomatic complexity: 10 Second operand has 40 states, 30 states have (on average 2.066666666666667) internal successors, (62), 34 states have internal predecessors, (62), 18 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (30), 17 states have call predecessors, (30), 18 states have call successors, (30) [2025-03-04 16:20:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:20:08,916 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-03-04 16:20:08,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 67 transitions. [2025-03-04 16:20:08,917 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:20:08,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 67 transitions. [2025-03-04 16:20:08,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-03-04 16:20:08,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-03-04 16:20:08,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 67 transitions. [2025-03-04 16:20:08,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:20:08,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 67 transitions. [2025-03-04 16:20:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 67 transitions. [2025-03-04 16:20:08,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-04 16:20:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 20 states have return successors, (23), 20 states have call predecessors, (23), 6 states have call successors, (23) [2025-03-04 16:20:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2025-03-04 16:20:08,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 67 transitions. [2025-03-04 16:20:08,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 16:20:08,923 INFO L432 stractBuchiCegarLoop]: Abstraction has 61 states and 67 transitions. [2025-03-04 16:20:08,923 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 16:20:08,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 67 transitions. [2025-03-04 16:20:08,924 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:20:08,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:20:08,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:20:08,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:20:08,931 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [210, 210, 180, 180, 180, 35, 35, 30, 30, 30, 30, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:20:08,932 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);"< [2025-03-04 16:20:08,932 INFO L754 eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);"< [2025-03-04 16:20:08,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:08,934 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 11 times [2025-03-04 16:20:08,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:08,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850281819] [2025-03-04 16:20:08,934 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:20:08,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:08,941 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:08,944 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:08,944 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:20:08,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:08,944 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:08,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:08,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:08,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:08,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:08,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:08,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:08,953 INFO L85 PathProgramCache]: Analyzing trace with hash -528204613, now seen corresponding path program 8 times [2025-03-04 16:20:08,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:08,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127675605] [2025-03-04 16:20:08,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:20:08,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:09,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1294 statements into 2 equivalence classes. [2025-03-04 16:20:09,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1294 of 1294 statements. [2025-03-04 16:20:09,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:20:09,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 107665 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 107614 trivial. 0 not checked. [2025-03-04 16:20:19,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:20:19,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127675605] [2025-03-04 16:20:19,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127675605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:20:19,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759961783] [2025-03-04 16:20:19,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:20:19,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:20:19,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:19,211 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:20:19,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 16:20:19,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1294 statements into 2 equivalence classes. [2025-03-04 16:20:20,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1294 of 1294 statements. [2025-03-04 16:20:20,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:20:20,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:20,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 7304 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-04 16:20:20,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:20,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:20:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 107665 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 107630 trivial. 0 not checked. [2025-03-04 16:20:20,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:20:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 107665 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 107575 trivial. 0 not checked. [2025-03-04 16:20:24,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759961783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:20:24,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:20:24,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 26] total 44 [2025-03-04 16:20:24,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393749597] [2025-03-04 16:20:24,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:20:24,968 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:20:24,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:20:24,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 16:20:24,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=1519, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 16:20:24,969 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. cyclomatic complexity: 10 Second operand has 44 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 37 states have internal predecessors, (56), 19 states have call successors, (21), 9 states have call predecessors, (21), 14 states have return successors, (28), 20 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 16:20:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:20:25,345 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2025-03-04 16:20:25,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 69 transitions. [2025-03-04 16:20:25,346 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:20:25,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 69 transitions. [2025-03-04 16:20:25,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-03-04 16:20:25,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2025-03-04 16:20:25,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 69 transitions. [2025-03-04 16:20:25,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:20:25,347 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 69 transitions. [2025-03-04 16:20:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 69 transitions. [2025-03-04 16:20:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 16:20:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 34 states have (on average 1.088235294117647) internal successors, (37), 37 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 21 states have return successors, (24), 21 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-04 16:20:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2025-03-04 16:20:25,350 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 69 transitions. [2025-03-04 16:20:25,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 16:20:25,351 INFO L432 stractBuchiCegarLoop]: Abstraction has 63 states and 69 transitions. [2025-03-04 16:20:25,351 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 16:20:25,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 69 transitions. [2025-03-04 16:20:25,351 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-04 16:20:25,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:20:25,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:20:25,355 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:20:25,355 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [252, 252, 216, 216, 216, 42, 42, 36, 36, 36, 36, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:20:25,356 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);"< [2025-03-04 16:20:25,356 INFO L754 eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#49#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#47#return;" "assume true;" >"#53#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#51#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);"< [2025-03-04 16:20:25,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 12 times [2025-03-04 16:20:25,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:25,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074052033] [2025-03-04 16:20:25,357 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:20:25,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:25,363 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:25,365 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:25,365 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 16:20:25,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:25,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:25,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:25,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:25,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:25,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:25,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:25,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1549498735, now seen corresponding path program 9 times [2025-03-04 16:20:25,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:25,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734947354] [2025-03-04 16:20:25,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:20:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:25,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1551 statements into 124 equivalence classes. [2025-03-04 16:20:31,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 124 check-sat command(s) and asserted 1551 of 1551 statements. [2025-03-04 16:20:31,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 124 check-sat command(s) [2025-03-04 16:20:31,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:31,266 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:31,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1551 statements into 1 equivalence classes. [2025-03-04 16:20:31,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1551 of 1551 statements. [2025-03-04 16:20:31,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:31,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:32,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:32,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:32,094 INFO L85 PathProgramCache]: Analyzing trace with hash -87595756, now seen corresponding path program 1 times [2025-03-04 16:20:32,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:32,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28480196] [2025-03-04 16:20:32,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:20:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:32,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1554 statements into 1 equivalence classes. [2025-03-04 16:20:32,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1554 of 1554 statements. [2025-03-04 16:20:32,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:32,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:32,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:32,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1554 statements into 1 equivalence classes. [2025-03-04 16:20:33,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1554 of 1554 statements. [2025-03-04 16:20:33,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:33,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:33,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace