./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB --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 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:33:17,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:33:17,891 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-27 20:33:17,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:33:17,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:33:17,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:33:17,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:33:17,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:33:17,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:33:17,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:33:17,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:33:17,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:33:17,952 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:33:17,952 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-27 20:33:17,952 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-27 20:33:17,952 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-27 20:33:17,952 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-27 20:33:17,952 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-27 20:33:17,953 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-27 20:33:17,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:33:17,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-27 20:33:17,953 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:33:17,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:33:17,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:33:17,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:33:17,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-27 20:33:17,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-27 20:33:17,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-27 20:33:17,955 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:33:17,955 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:33:17,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:33:17,955 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-27 20:33:17,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:33:17,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:33:17,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:33:17,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:33:17,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:33:17,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2024-11-27 20:33:17,957 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-27 20:33:17,957 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c [2024-11-27 20:33:18,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:33:18,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:33:18,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:33:18,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:33:18,387 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:33:18,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-11-27 20:33:21,759 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/data/e5f9b7a44/bf34f015657743dabcd4d120d992b70d/FLAG982ae221b [2024-11-27 20:33:22,129 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:33:22,130 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-11-27 20:33:22,138 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/data/e5f9b7a44/bf34f015657743dabcd4d120d992b70d/FLAG982ae221b [2024-11-27 20:33:22,164 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/data/e5f9b7a44/bf34f015657743dabcd4d120d992b70d [2024-11-27 20:33:22,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:33:22,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:33:22,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:33:22,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:33:22,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:33:22,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6270bae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22, skipping insertion in model container [2024-11-27 20:33:22,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:33:22,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:33:22,453 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:33:22,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:33:22,495 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:33:22,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22 WrapperNode [2024-11-27 20:33:22,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:33:22,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:33:22,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:33:22,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:33:22,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,536 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-11-27 20:33:22,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:33:22,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:33:22,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:33:22,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:33:22,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,569 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]. [2024-11-27 20:33:22,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,578 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:33:22,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:33:22,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:33:22,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:33:22,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (1/1) ... [2024-11-27 20:33:22,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:33:22,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:33:22,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:33:22,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-27 20:33:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:33:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2024-11-27 20:33:22,670 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2024-11-27 20:33:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:33:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 20:33:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 20:33:22,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-27 20:33:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-27 20:33:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:33:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 20:33:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 20:33:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 20:33:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-27 20:33:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-27 20:33:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-27 20:33:22,671 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-27 20:33:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2024-11-27 20:33:22,671 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2024-11-27 20:33:22,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:33:22,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:33:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 20:33:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 20:33:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 20:33:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-27 20:33:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-27 20:33:22,672 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-27 20:33:22,672 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-27 20:33:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:33:22,790 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:33:22,793 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:33:23,168 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-27 20:33:23,169 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:33:23,188 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:33:23,189 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 20:33:23,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:33:23 BoogieIcfgContainer [2024-11-27 20:33:23,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:33:23,191 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-27 20:33:23,192 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-27 20:33:23,200 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-27 20:33:23,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-27 20:33:23,201 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.11 08:33:22" (1/3) ... [2024-11-27 20:33:23,202 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60557c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.11 08:33:23, skipping insertion in model container [2024-11-27 20:33:23,202 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-27 20:33:23,203 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:33:22" (2/3) ... [2024-11-27 20:33:23,204 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60557c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.11 08:33:23, skipping insertion in model container [2024-11-27 20:33:23,204 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-27 20:33:23,205 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:33:23" (3/3) ... [2024-11-27 20:33:23,206 INFO L363 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2024-11-27 20:33:23,264 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-27 20:33:23,264 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-27 20:33:23,264 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-27 20:33:23,264 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-27 20:33:23,264 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-27 20:33:23,264 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-27 20:33:23,265 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-27 20:33:23,265 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-27 20:33:23,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 40 states have internal predecessors, (49), 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) [2024-11-27 20:33:23,291 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2024-11-27 20:33:23,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:33:23,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:33:23,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-27 20:33:23,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-27 20:33:23,297 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-27 20:33:23,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 40 states have internal predecessors, (49), 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) [2024-11-27 20:33:23,301 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2024-11-27 20:33:23,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:33:23,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:33:23,302 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-27 20:33:23,302 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-27 20:33:23,311 INFO L747 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~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2024-11-27 20:33:23,311 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;" "main_~b~0#1 := 0;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2024-11-27 20:33:23,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:23,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2024-11-27 20:33:23,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:23,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814717302] [2024-11-27 20:33:23,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:23,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:23,444 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:33:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:23,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:33:23,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:23,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2128333, now seen corresponding path program 1 times [2024-11-27 20:33:23,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:23,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529230602] [2024-11-27 20:33:23,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:23,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:23,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:33:23,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529230602] [2024-11-27 20:33:23,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529230602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:33:23,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858493325] [2024-11-27 20:33:23,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:23,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:33:23,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:33:23,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:33:23,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:33:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:23,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:33:23,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:33:23,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:33:23,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858493325] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:33:23,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:33:23,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-27 20:33:23,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025412138] [2024-11-27 20:33:23,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:33:23,699 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:33:23,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:33:23,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:33:23,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:33:23,734 INFO L87 Difference]: Start difference. First operand has 49 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 40 states have internal predecessors, (49), 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 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:33:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:33:23,795 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-27 20:33:23,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2024-11-27 20:33:23,801 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 30 [2024-11-27 20:33:23,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 40 states and 50 transitions. [2024-11-27 20:33:23,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-27 20:33:23,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-11-27 20:33:23,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2024-11-27 20:33:23,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:33:23,815 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-11-27 20:33:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2024-11-27 20:33:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-27 20:33:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-27 20:33:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-11-27 20:33:23,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-11-27 20:33:23,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:33:23,853 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-11-27 20:33:23,853 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-27 20:33:23,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2024-11-27 20:33:23,855 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 30 [2024-11-27 20:33:23,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:33:23,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:33:23,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-27 20:33:23,860 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-27 20:33:23,860 INFO L747 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~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2024-11-27 20:33:23,861 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;" "main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2024-11-27 20:33:23,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2024-11-27 20:33:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:23,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353102559] [2024-11-27 20:33:23,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:23,907 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:33:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:23,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:33:23,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash -766263897, now seen corresponding path program 1 times [2024-11-27 20:33:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:23,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70171543] [2024-11-27 20:33:23,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:23,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:24,441 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-27 20:33:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:24,545 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-27 20:33:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:24,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:33:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70171543] [2024-11-27 20:33:24,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70171543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:33:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586208240] [2024-11-27 20:33:24,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:24,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:33:24,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:33:24,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:33:24,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:33:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:24,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:33:24,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:33:24,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:33:24,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586208240] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:33:24,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:33:24,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-27 20:33:24,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250942246] [2024-11-27 20:33:24,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:33:24,976 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:33:24,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:33:24,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 20:33:24,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:33:24,980 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 15 Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 20:33:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:33:25,519 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2024-11-27 20:33:25,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 81 transitions. [2024-11-27 20:33:25,524 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:33:25,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 81 transitions. [2024-11-27 20:33:25,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2024-11-27 20:33:25,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-11-27 20:33:25,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 81 transitions. [2024-11-27 20:33:25,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:33:25,532 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 81 transitions. [2024-11-27 20:33:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 81 transitions. [2024-11-27 20:33:25,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2024-11-27 20:33:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 13 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:33:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-11-27 20:33:25,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-11-27 20:33:25,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:33:25,548 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-11-27 20:33:25,549 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-27 20:33:25,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 72 transitions. [2024-11-27 20:33:25,550 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:33:25,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:33:25,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:33:25,556 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-27 20:33:25,556 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2024-11-27 20:33:25,556 INFO L747 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~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2024-11-27 20:33:25,556 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;" "main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2024-11-27 20:33:25,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:25,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times [2024-11-27 20:33:25,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:25,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194631532] [2024-11-27 20:33:25,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:25,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:25,577 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:33:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:25,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:33:25,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:25,593 INFO L85 PathProgramCache]: Analyzing trace with hash 204141837, now seen corresponding path program 1 times [2024-11-27 20:33:25,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:25,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508318550] [2024-11-27 20:33:25,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:25,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:26,566 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-27 20:33:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:26,730 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:26,823 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:26,833 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:26,992 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,086 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,097 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-27 20:33:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,175 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,182 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,189 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-27 20:33:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,219 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,228 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,237 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-27 20:33:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,261 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,267 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,273 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-27 20:33:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,304 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,313 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:33:27,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508318550] [2024-11-27 20:33:27,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508318550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:33:27,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217242395] [2024-11-27 20:33:27,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:27,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:33:27,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:33:27,329 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:33:27,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:33:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:27,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-27 20:33:27,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:33:27,766 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 [2024-11-27 20:33:27,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:33:28,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217242395] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:33:28,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:33:28,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 16 [2024-11-27 20:33:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495568673] [2024-11-27 20:33:28,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:33:28,281 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:33:28,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:33:28,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-27 20:33:28,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-27 20:33:28,282 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. cyclomatic complexity: 19 Second operand has 16 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-27 20:33:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:33:28,644 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2024-11-27 20:33:28,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 80 transitions. [2024-11-27 20:33:28,649 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:33:28,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 80 transitions. [2024-11-27 20:33:28,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2024-11-27 20:33:28,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-11-27 20:33:28,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 80 transitions. [2024-11-27 20:33:28,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:33:28,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 80 transitions. [2024-11-27 20:33:28,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 80 transitions. [2024-11-27 20:33:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-11-27 20:33:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-27 20:33:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2024-11-27 20:33:28,670 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 74 transitions. [2024-11-27 20:33:28,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:33:28,673 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 74 transitions. [2024-11-27 20:33:28,674 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-27 20:33:28,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 74 transitions. [2024-11-27 20:33:28,676 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:33:28,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:33:28,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:33:28,684 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-27 20:33:28,688 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2024-11-27 20:33:28,689 INFO L747 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~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2024-11-27 20:33:28,689 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;" "main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2024-11-27 20:33:28,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:28,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times [2024-11-27 20:33:28,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:28,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863731710] [2024-11-27 20:33:28,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:28,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:28,709 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:33:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:28,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:33:28,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1627041855, now seen corresponding path program 1 times [2024-11-27 20:33:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:28,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348973219] [2024-11-27 20:33:28,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:29,571 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-27 20:33:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:29,714 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:29,821 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:29,878 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:29,883 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:29,893 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,005 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,102 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,134 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,138 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,143 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-27 20:33:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,163 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,173 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,176 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,181 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,185 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-27 20:33:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,286 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,368 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,436 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,441 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,447 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-27 20:33:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,469 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,480 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,484 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,489 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,496 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-27 20:33:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,518 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,528 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,532 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,536 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:33:30,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348973219] [2024-11-27 20:33:30,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348973219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:33:30,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662621079] [2024-11-27 20:33:30,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:30,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:33:30,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:33:30,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:33:30,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:33:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:30,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-27 20:33:30,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:33:30,998 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 [2024-11-27 20:33:31,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:33:32,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662621079] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:33:32,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:33:32,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2024-11-27 20:33:32,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056127310] [2024-11-27 20:33:32,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:33:32,209 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:33:32,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:33:32,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-27 20:33:32,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2024-11-27 20:33:32,211 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. cyclomatic complexity: 19 Second operand has 26 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 10 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (22), 6 states have call predecessors, (22), 10 states have call successors, (22) [2024-11-27 20:33:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:33:32,957 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2024-11-27 20:33:32,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 81 transitions. [2024-11-27 20:33:32,960 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:33:32,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 81 transitions. [2024-11-27 20:33:32,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2024-11-27 20:33:32,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-11-27 20:33:32,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 81 transitions. [2024-11-27 20:33:32,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:33:32,971 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-11-27 20:33:32,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 81 transitions. [2024-11-27 20:33:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-27 20:33:32,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 8 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-27 20:33:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2024-11-27 20:33:32,985 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 78 transitions. [2024-11-27 20:33:32,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:33:32,987 INFO L425 stractBuchiCegarLoop]: Abstraction has 64 states and 78 transitions. [2024-11-27 20:33:32,987 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-27 20:33:32,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 78 transitions. [2024-11-27 20:33:32,989 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:33:32,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:33:32,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:33:33,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-27 20:33:33,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2024-11-27 20:33:33,007 INFO L747 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~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2024-11-27 20:33:33,007 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;" "main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2024-11-27 20:33:33,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:33,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times [2024-11-27 20:33:33,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:33,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679890063] [2024-11-27 20:33:33,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:33,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:33,025 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:33:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:33,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:33:33,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:33,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1749131947, now seen corresponding path program 1 times [2024-11-27 20:33:33,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:33,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925632374] [2024-11-27 20:33:33,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:33,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:34,506 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-27 20:33:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:34,733 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:34,844 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:34,921 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:34,971 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:34,975 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:34,980 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-27 20:33:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,009 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,024 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,038 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,041 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,045 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,049 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-27 20:33:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,056 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-27 20:33:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,289 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,366 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,409 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,432 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,435 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,438 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-27 20:33:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,458 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,473 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,480 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,484 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,488 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,492 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-27 20:33:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,497 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-27 20:33:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,535 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,548 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,555 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,558 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,561 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,566 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-27 20:33:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,591 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,608 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,618 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,622 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,626 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,631 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-27 20:33:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,636 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-27 20:33:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,686 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,703 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,711 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,714 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,719 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,723 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-27 20:33:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,753 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,768 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,776 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,781 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,785 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,788 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-27 20:33:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,793 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-27 20:33:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,836 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,851 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,858 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,861 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,864 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,868 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-27 20:33:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,891 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,904 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,911 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,914 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,919 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,923 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-27 20:33:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,930 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-11-27 20:33:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,970 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,983 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,990 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,993 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:35,997 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:36,001 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-27 20:33:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:36,021 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:36,034 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:36,042 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:36,045 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:33:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:36,048 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:33:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:36,052 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-27 20:33:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:36,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:33:36,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925632374] [2024-11-27 20:33:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925632374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:33:36,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127243545] [2024-11-27 20:33:36,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:36,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:33:36,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:33:36,085 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:33:36,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:33:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:36,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 3392 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-27 20:33:37,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:33:37,016 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 [2024-11-27 20:33:37,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:33:38,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127243545] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:33:38,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:33:38,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2024-11-27 20:33:38,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619129842] [2024-11-27 20:33:38,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:33:38,673 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:33:38,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:33:38,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-27 20:33:38,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2024-11-27 20:33:38,675 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. cyclomatic complexity: 19 Second operand has 24 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 17 states have internal predecessors, (70), 9 states have call successors, (34), 9 states have call predecessors, (34), 7 states have return successors, (28), 6 states have call predecessors, (28), 9 states have call successors, (28) [2024-11-27 20:33:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:33:39,296 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2024-11-27 20:33:39,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 82 transitions. [2024-11-27 20:33:39,297 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:33:39,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 82 transitions. [2024-11-27 20:33:39,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2024-11-27 20:33:39,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2024-11-27 20:33:39,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 82 transitions. [2024-11-27 20:33:39,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:33:39,305 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 82 transitions. [2024-11-27 20:33:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 82 transitions. [2024-11-27 20:33:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-27 20:33:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 48 states have internal predecessors, (50), 13 states have call successors, (13), 4 states have call predecessors, (13), 10 states have return successors, (19), 15 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-27 20:33:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2024-11-27 20:33:39,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 82 transitions. [2024-11-27 20:33:39,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:33:39,321 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2024-11-27 20:33:39,321 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-27 20:33:39,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 82 transitions. [2024-11-27 20:33:39,322 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:33:39,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:33:39,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:33:39,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-27 20:33:39,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 48, 48, 36, 36, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2024-11-27 20:33:39,329 INFO L747 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~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2024-11-27 20:33:39,330 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;" "main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2024-11-27 20:33:39,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:39,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times [2024-11-27 20:33:39,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:39,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843396116] [2024-11-27 20:33:39,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:39,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:39,341 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:33:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:39,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:33:39,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:39,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2091711915, now seen corresponding path program 1 times [2024-11-27 20:33:39,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:39,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422340003] [2024-11-27 20:33:39,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:39,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:42,827 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-27 20:33:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:43,378 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:43,595 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:43,609 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:43,613 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:43,615 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:43,619 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:43,753 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:43,849 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:43,968 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,019 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,022 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,025 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-27 20:33:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,057 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,076 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,083 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,087 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,089 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,092 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,103 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,111 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,115 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,117 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,120 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,123 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-27 20:33:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,127 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-27 20:33:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,187 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,208 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,216 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,220 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,223 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,226 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,239 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,247 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,251 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,253 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,256 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,260 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-27 20:33:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,287 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,309 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,318 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,322 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,324 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,327 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,339 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,347 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,351 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,353 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,356 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,359 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-27 20:33:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,363 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-27 20:33:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,427 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,447 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,456 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,460 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,463 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,466 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,479 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,488 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,492 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,498 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,506 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,509 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-27 20:33:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,562 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,613 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,622 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,627 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,630 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,633 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,646 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,655 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,659 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,662 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,666 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,669 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-27 20:33:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,673 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2024-11-27 20:33:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,775 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,794 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,801 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,805 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,807 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,810 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,821 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,828 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,832 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,835 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,837 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,840 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-27 20:33:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,864 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,886 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,898 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,902 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,905 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,908 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,919 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,926 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,931 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,933 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,936 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,939 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-27 20:33:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,943 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 556 [2024-11-27 20:33:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:44,997 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,016 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,023 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,028 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,033 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,036 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,048 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,055 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,059 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,061 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,064 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,067 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-27 20:33:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,091 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,112 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,120 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,124 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,126 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,129 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,140 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,149 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,153 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,155 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,159 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,162 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-27 20:33:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,165 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 694 [2024-11-27 20:33:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,221 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,244 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,254 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,258 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,260 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,262 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,273 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,281 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,285 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,287 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,290 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,294 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-27 20:33:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,319 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,340 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,352 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,357 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,360 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,363 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,374 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,383 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,387 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,390 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:33:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,393 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-27 20:33:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,396 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-27 20:33:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:45,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:33:45,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422340003] [2024-11-27 20:33:45,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422340003] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:33:45,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099222995] [2024-11-27 20:33:45,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:45,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:33:45,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:33:45,406 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:33:45,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:33:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:46,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 5816 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-27 20:33:46,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:33:46,815 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 [2024-11-27 20:33:47,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:33:49,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099222995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:33:49,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:33:49,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 28 [2024-11-27 20:33:49,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897668871] [2024-11-27 20:33:49,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:33:49,956 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:33:49,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:33:49,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-27 20:33:49,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2024-11-27 20:33:49,958 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. cyclomatic complexity: 19 Second operand has 28 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 10 states have call successors, (41), 8 states have call predecessors, (41), 7 states have return successors, (33), 6 states have call predecessors, (33), 10 states have call successors, (33) [2024-11-27 20:33:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:33:50,481 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2024-11-27 20:33:50,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 86 transitions. [2024-11-27 20:33:50,482 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:33:50,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 86 transitions. [2024-11-27 20:33:50,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-11-27 20:33:50,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2024-11-27 20:33:50,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 86 transitions. [2024-11-27 20:33:50,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:33:50,484 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 86 transitions. [2024-11-27 20:33:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 86 transitions. [2024-11-27 20:33:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-27 20:33:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 50 states have internal predecessors, (52), 13 states have call successors, (13), 4 states have call predecessors, (13), 12 states have return successors, (21), 17 states have call predecessors, (21), 13 states have call successors, (21) [2024-11-27 20:33:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2024-11-27 20:33:50,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 86 transitions. [2024-11-27 20:33:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:33:50,491 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 86 transitions. [2024-11-27 20:33:50,491 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-27 20:33:50,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 86 transitions. [2024-11-27 20:33:50,492 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:33:50,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:33:50,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:33:50,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-27 20:33:50,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [96, 96, 72, 72, 72, 48, 48, 36, 36, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2024-11-27 20:33:50,504 INFO L747 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~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2024-11-27 20:33:50,504 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;" "main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2024-11-27 20:33:50,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times [2024-11-27 20:33:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:50,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174203300] [2024-11-27 20:33:50,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:50,515 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:33:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:33:50,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:33:50,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1941489067, now seen corresponding path program 2 times [2024-11-27 20:33:50,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:33:50,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586607562] [2024-11-27 20:33:50,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:50,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:53,870 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-27 20:33:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,320 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,547 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,562 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,568 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,572 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,576 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,578 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,580 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,712 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,857 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,871 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,876 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,879 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,881 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,922 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,925 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-27 20:33:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,956 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,977 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,986 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,991 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,996 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:54,999 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,001 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,003 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,015 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,023 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,029 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,034 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,038 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,040 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,042 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,045 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-27 20:33:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,049 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-27 20:33:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,114 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,137 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,151 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,158 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,162 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,166 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,168 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,170 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,241 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,250 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,257 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,263 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,267 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,270 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,273 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,276 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-27 20:33:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,311 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,341 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,352 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,360 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,367 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,371 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,373 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,376 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,394 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,405 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,413 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,419 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,424 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,426 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,429 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,432 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-27 20:33:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,438 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-11-27 20:33:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,522 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,546 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,558 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,566 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,573 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,577 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,580 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,582 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,599 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,612 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,620 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,626 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,631 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,634 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,636 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,639 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-27 20:33:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,676 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,706 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,718 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,726 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,732 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,736 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,739 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,741 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,758 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,771 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,780 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,786 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,791 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,794 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,797 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,800 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-27 20:33:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,804 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 538 [2024-11-27 20:33:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,872 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,896 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,907 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,915 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,921 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,926 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,929 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,932 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,950 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,963 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,971 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,978 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,983 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,985 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,988 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:55,992 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-27 20:33:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,029 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,059 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,072 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,081 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,088 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,093 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,096 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,099 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,119 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,133 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,143 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,150 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,154 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,157 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,160 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,164 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-27 20:33:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,168 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 716 [2024-11-27 20:33:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,608 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,756 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,852 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,865 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,869 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,872 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,873 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,894 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,911 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,921 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,929 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,935 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,939 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,941 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,944 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,946 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-27 20:33:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:56,982 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,117 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,133 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,138 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,143 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,146 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,147 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,149 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,161 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,170 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,176 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,179 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,181 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,183 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,184 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,185 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-27 20:33:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,187 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 894 [2024-11-27 20:33:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,234 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,252 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,260 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,266 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,271 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,274 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,276 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,278 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,290 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,299 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,304 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,309 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,313 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,314 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,316 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,319 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-27 20:33:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,343 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,365 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,374 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,380 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,385 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,388 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,389 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,390 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,399 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,407 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,413 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,418 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,421 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:33:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,423 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:33:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,425 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-27 20:33:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,427 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-27 20:33:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:57,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:33:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586607562] [2024-11-27 20:33:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586607562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:33:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584668585] [2024-11-27 20:33:57,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:57,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:33:57,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:33:57,437 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:33:57,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:33:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:58,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 7112 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-27 20:33:58,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:33:58,925 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 [2024-11-27 20:33:59,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:34:02,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584668585] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:34:02,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:34:02,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 32 [2024-11-27 20:34:02,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479885493] [2024-11-27 20:34:02,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:34:02,203 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:34:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:34:02,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-27 20:34:02,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2024-11-27 20:34:02,205 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. cyclomatic complexity: 19 Second operand has 32 states, 25 states have (on average 3.24) internal successors, (81), 24 states have internal predecessors, (81), 13 states have call successors, (39), 10 states have call predecessors, (39), 10 states have return successors, (34), 11 states have call predecessors, (34), 13 states have call successors, (34) [2024-11-27 20:34:03,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:34:03,025 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2024-11-27 20:34:03,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 90 transitions. [2024-11-27 20:34:03,027 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:34:03,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 90 transitions. [2024-11-27 20:34:03,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2024-11-27 20:34:03,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-11-27 20:34:03,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 90 transitions. [2024-11-27 20:34:03,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:34:03,029 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 90 transitions. [2024-11-27 20:34:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 90 transitions. [2024-11-27 20:34:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-27 20:34:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 52 states have internal predecessors, (54), 13 states have call successors, (13), 4 states have call predecessors, (13), 14 states have return successors, (23), 19 states have call predecessors, (23), 13 states have call successors, (23) [2024-11-27 20:34:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2024-11-27 20:34:03,034 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 90 transitions. [2024-11-27 20:34:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-27 20:34:03,040 INFO L425 stractBuchiCegarLoop]: Abstraction has 76 states and 90 transitions. [2024-11-27 20:34:03,040 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-27 20:34:03,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 90 transitions. [2024-11-27 20:34:03,041 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:34:03,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:34:03,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:34:03,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-27 20:34:03,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [288, 288, 216, 216, 216, 108, 108, 72, 72, 72, 72, 72, 72, 72, 54, 54, 36, 36, 36, 36, 36, 36, 36, 24, 24, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2024-11-27 20:34:03,057 INFO L747 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~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2024-11-27 20:34:03,058 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;" "main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2024-11-27 20:34:03,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:03,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times [2024-11-27 20:34:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:34:03,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749054702] [2024-11-27 20:34:03,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:03,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:34:03,072 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:34:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:34:03,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:34:03,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:03,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1794998259, now seen corresponding path program 3 times [2024-11-27 20:34:03,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:34:03,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989412978] [2024-11-27 20:34:03,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:03,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,476 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-27 20:34:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,563 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,593 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,608 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,612 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,615 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,618 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,619 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,624 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,628 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,632 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,637 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,642 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,648 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,666 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,682 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,688 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,692 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,696 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,698 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,706 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,712 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,717 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,720 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,724 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,726 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,729 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,806 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,837 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,847 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,852 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,855 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,857 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,859 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,865 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,869 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,873 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,878 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,880 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,882 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,901 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,917 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,923 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,927 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,930 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,931 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,938 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,942 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,946 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,948 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,950 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,951 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,953 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:14,980 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,016 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,032 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,038 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,043 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,047 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,049 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,058 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,063 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,118 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,128 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,130 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,131 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,144 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,154 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,159 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,161 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,164 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,165 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,171 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,176 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,179 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,181 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,182 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,184 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,185 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:15,187 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 423 [2024-11-27 20:34:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:16,364 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:16,713 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:16,960 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:16,973 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:16,977 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:16,980 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:16,981 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,184 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,403 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,543 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,638 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,700 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,703 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,733 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,754 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,762 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,768 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,772 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,774 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,784 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,789 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,793 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,796 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,797 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,799 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,801 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,894 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,928 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,942 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,948 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,953 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,956 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,957 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,965 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,971 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,975 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,978 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,980 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,982 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:17,999 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,015 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,020 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,025 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,028 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,030 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,038 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,043 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,048 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,051 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,053 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,056 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,059 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,106 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,142 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,158 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,164 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,169 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,172 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,174 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,182 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,186 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,190 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,192 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,194 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,196 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,214 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,228 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,232 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,236 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,238 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,240 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,247 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,252 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,256 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,259 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,260 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,262 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,263 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,266 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 842 [2024-11-27 20:34:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,362 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,388 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,399 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,404 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,407 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,410 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,411 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,418 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,422 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,426 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,429 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,430 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,432 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,445 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,460 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,467 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,472 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,476 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,478 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,488 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,495 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,500 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,504 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,506 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,508 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,511 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,584 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,619 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,634 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,641 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,647 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,650 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,653 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,663 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,670 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,675 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,679 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,681 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,683 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,703 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,718 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,723 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,728 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,731 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,732 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,739 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,745 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,749 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,752 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,753 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,755 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,757 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,785 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,811 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,826 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,834 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,840 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,844 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,847 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,857 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,865 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,871 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,875 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,877 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,879 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,895 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,908 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,913 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,919 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,922 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,924 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,932 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,937 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,942 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,945 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,947 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,948 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,950 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:18,953 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2024-11-27 20:34:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,052 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,078 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,091 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,097 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,101 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,104 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,120 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,128 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,133 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,138 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,141 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,143 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,145 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,160 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,172 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,178 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,183 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,186 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,188 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,196 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,202 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,206 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,210 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,212 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,214 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,216 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,270 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,296 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,309 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,318 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,325 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,329 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,331 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,339 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,345 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,350 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,353 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,355 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,357 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,374 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,388 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,395 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,400 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,404 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,406 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,416 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,423 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,428 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,432 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,434 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,436 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,439 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,477 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,516 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,535 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,544 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,551 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,556 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,559 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,571 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,580 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,587 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,592 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,595 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,598 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,620 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,637 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,644 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,649 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,653 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,655 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,665 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,672 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,678 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,682 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,684 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,686 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,689 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,691 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1680 [2024-11-27 20:34:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,795 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,824 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,839 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,846 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,851 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,855 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,858 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,868 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,875 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,880 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,886 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,888 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,891 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,910 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,927 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,934 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,940 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,944 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,946 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,956 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,964 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,971 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,976 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,978 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,980 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:19,983 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,054 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,092 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,108 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,115 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,121 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,126 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,129 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,143 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,153 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,159 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,164 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,166 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,169 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,187 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,204 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,212 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,218 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,223 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,226 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,242 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,251 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,258 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,263 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,266 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,269 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,272 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,310 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,344 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,361 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,370 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,377 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,386 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,390 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,406 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,418 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,427 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,433 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,437 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,441 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,467 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,491 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,502 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,511 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,518 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,522 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,537 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,548 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,558 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,565 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,569 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,573 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,577 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,582 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2099 [2024-11-27 20:34:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,715 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,892 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,903 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,907 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,910 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,912 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,913 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,919 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,924 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,927 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,929 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,930 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,932 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,946 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,956 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,960 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,963 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,965 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,967 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,973 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,977 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,980 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,982 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,983 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,985 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:20,986 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,038 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,065 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,076 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,080 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,083 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,085 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,087 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,094 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,098 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,102 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,104 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,106 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,107 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,120 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,133 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,138 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,141 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,144 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,145 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,152 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,156 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,160 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,162 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,163 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,165 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,167 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,194 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,218 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,230 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,234 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,237 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,240 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,242 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,250 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,254 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,258 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,260 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,262 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,263 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,277 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,288 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,292 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,296 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,299 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,301 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,312 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,319 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,324 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,328 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,330 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:34:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,333 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:34:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,336 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-27 20:34:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:21,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:34:21,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989412978] [2024-11-27 20:34:21,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989412978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:34:21,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131470248] [2024-11-27 20:34:21,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:21,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:34:21,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:34:21,345 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:34:21,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:34:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:24,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 15704 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-27 20:34:24,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:34:24,904 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 [2024-11-27 20:34:25,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:34:35,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131470248] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:34:35,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:34:35,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 18] total 45 [2024-11-27 20:34:35,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924322783] [2024-11-27 20:34:35,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:34:35,136 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:34:35,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:34:35,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-27 20:34:35,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1712, Unknown=0, NotChecked=0, Total=1980 [2024-11-27 20:34:35,138 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. cyclomatic complexity: 19 Second operand has 45 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 37 states have internal predecessors, (98), 18 states have call successors, (51), 10 states have call predecessors, (51), 12 states have return successors, (50), 14 states have call predecessors, (50), 18 states have call successors, (50) [2024-11-27 20:34:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:34:36,089 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2024-11-27 20:34:36,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 94 transitions. [2024-11-27 20:34:36,091 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:34:36,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 94 transitions. [2024-11-27 20:34:36,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2024-11-27 20:34:36,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2024-11-27 20:34:36,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 94 transitions. [2024-11-27 20:34:36,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:34:36,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-27 20:34:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 94 transitions. [2024-11-27 20:34:36,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-27 20:34:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 54 states have internal predecessors, (56), 13 states have call successors, (13), 4 states have call predecessors, (13), 16 states have return successors, (25), 21 states have call predecessors, (25), 13 states have call successors, (25) [2024-11-27 20:34:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-27 20:34:36,102 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-27 20:34:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-27 20:34:36,104 INFO L425 stractBuchiCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-27 20:34:36,104 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-27 20:34:36,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 94 transitions. [2024-11-27 20:34:36,107 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:34:36,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:34:36,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:34:36,122 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-27 20:34:36,122 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [432, 432, 360, 360, 360, 108, 108, 72, 72, 72, 72, 72, 72, 72, 54, 54, 36, 36, 36, 36, 36, 36, 36, 24, 24, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2024-11-27 20:34:36,122 INFO L747 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~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2024-11-27 20:34:36,123 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;" "main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2024-11-27 20:34:36,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:36,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times [2024-11-27 20:34:36,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:34:36,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322126519] [2024-11-27 20:34:36,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:36,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:34:36,149 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:34:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:34:36,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:34:36,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1091745267, now seen corresponding path program 4 times [2024-11-27 20:34:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:34:36,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385567080] [2024-11-27 20:34:36,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:36,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:50,127 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-27 20:34:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:51,585 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:51,996 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,014 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,019 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,024 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,028 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,030 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,032 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,033 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,041 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,047 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,051 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,055 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,058 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,060 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,061 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,063 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-27 20:34:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,500 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:52,980 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,237 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,370 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,475 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,540 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,591 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,629 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,638 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,646 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,653 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,659 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,663 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,667 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,668 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,670 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-27 20:34:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,673 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-27 20:34:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,844 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,893 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,913 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,921 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,928 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,933 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,937 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,940 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,942 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,952 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,959 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,965 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,970 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,974 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,976 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,978 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:53,980 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-27 20:34:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,001 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,019 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,026 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,033 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,038 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,042 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,046 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,047 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,059 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,067 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,075 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,081 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,086 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,090 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,092 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,094 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-27 20:34:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,096 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-27 20:34:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,147 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,189 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,207 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,215 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,222 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,228 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,232 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,236 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,237 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,249 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,257 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,264 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,270 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,274 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,277 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,279 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,281 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-27 20:34:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,304 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,324 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,332 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,340 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,346 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,351 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,354 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,356 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,368 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,377 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,385 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,392 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,397 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,401 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,403 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,405 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-27 20:34:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,407 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-27 20:34:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,411 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 543 [2024-11-27 20:34:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,552 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,584 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,599 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,606 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,612 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,617 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,620 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,623 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,625 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,633 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,640 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,646 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,650 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,654 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,657 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,658 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,659 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-27 20:34:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,677 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,693 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,701 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,707 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,713 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,717 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,720 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,722 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,735 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,747 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,756 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,764 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,770 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,774 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,777 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,780 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-27 20:34:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,783 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-27 20:34:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,888 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,936 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,957 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,966 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,974 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,982 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,988 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,992 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:54,995 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:55,008 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:55,019 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:55,029 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:55,037 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:55,043 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:55,048 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:34:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:55,050 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:34:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:55,053 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-27 20:34:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:55,078 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2024-11-27 20:40:21,929 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:21,938 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:21,945 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:21,951 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:21,955 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:21,958 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:21,960 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,013 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,065 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,079 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,091 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,102 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,112 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,119 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,124 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,127 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,169 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,183 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,195 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,206 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,216 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,223 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,228 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,231 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,263 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,277 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,289 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,301 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,311 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,318 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,324 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,327 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,345 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,361 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,374 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,389 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,402 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,412 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,419 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,422 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,425 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,430 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-11-27 20:40:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,601 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,755 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,808 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,822 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,836 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,847 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,857 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,865 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,871 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:22,874 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,137 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,143 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,149 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,154 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,158 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,161 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,163 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,164 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,180 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,189 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,195 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,200 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,204 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,207 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,210 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,211 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,221 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,228 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,235 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,241 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,246 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,249 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,252 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,253 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,255 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,341 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,373 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,380 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,387 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,393 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,397 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,401 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,403 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,404 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,429 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,437 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,444 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,450 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,455 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,459 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,462 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,463 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,481 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,489 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,496 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,502 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,506 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,510 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,513 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,514 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,525 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,533 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,540 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,547 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,552 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,556 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,559 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,561 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,562 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,601 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,633 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,642 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,649 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,656 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,661 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,666 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,669 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,671 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,698 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,706 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,714 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,720 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,726 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,730 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,733 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,735 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,754 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,763 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,771 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,777 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,783 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,788 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,791 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,793 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,804 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,813 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,821 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,828 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,834 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,839 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,842 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,844 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,846 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,848 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-11-27 20:40:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:23,853 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8084 [2024-11-27 20:40:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,350 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,461 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,497 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,506 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,514 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,521 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,526 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,531 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,535 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,536 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,565 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,574 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,583 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,591 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,598 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,603 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,606 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,608 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,630 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,640 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,649 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,657 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,663 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,668 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,672 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,819 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,828 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,835 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,841 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,846 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,850 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,853 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,856 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,857 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,858 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,926 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,957 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,964 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,969 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,974 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,978 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,981 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,983 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:24,985 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,008 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,015 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,021 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,027 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,032 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,036 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,038 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,040 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,057 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,065 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,072 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,077 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,082 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,086 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,089 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,090 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,100 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,108 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,115 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,121 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,126 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,129 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,132 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,133 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,135 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,170 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,204 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,212 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,219 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,225 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,230 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,233 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,236 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,238 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,263 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,272 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,279 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,286 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,292 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,296 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,299 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,301 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,319 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,328 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,335 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,342 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,347 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,352 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,355 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,356 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,367 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,376 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,383 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,390 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,396 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,401 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,404 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,406 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,408 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,410 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-11-27 20:40:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,654 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,761 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,796 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,804 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,812 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,819 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,825 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,829 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,832 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,834 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,864 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,873 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,880 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,888 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,894 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,899 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,902 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,904 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,924 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,933 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,942 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,950 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,956 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,961 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,965 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,967 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,979 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:25,989 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,000 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,008 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,014 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,018 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,022 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,024 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,026 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,101 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,136 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,147 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,155 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,162 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,169 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,174 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,178 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,180 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,210 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,221 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,230 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,238 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,245 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,251 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,255 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,257 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,278 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,288 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,298 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,306 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,313 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,319 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,323 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,325 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,339 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,350 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,360 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,368 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,375 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,381 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,385 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,387 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,390 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,430 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,468 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,478 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,488 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,497 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,504 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,509 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,513 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,515 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,547 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,558 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,568 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,577 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,584 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,590 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,594 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,596 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,619 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,630 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,640 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,649 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,657 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,663 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,667 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,670 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,684 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,696 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,706 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,715 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,723 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,728 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,733 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,735 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,737 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,740 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-11-27 20:40:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,846 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,947 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,982 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:26,993 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,002 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,011 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,018 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,023 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,027 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,029 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,058 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,069 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,079 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,088 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,096 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,102 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,106 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,108 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,132 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,144 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,155 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,165 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,173 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,179 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,184 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,186 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,201 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,214 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,225 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,235 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,244 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,250 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,255 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,258 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,260 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,339 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,379 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,392 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,404 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,414 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,422 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,429 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,434 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,436 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,470 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,482 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,495 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,505 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,514 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,520 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,525 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,528 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,553 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,566 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,577 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,588 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,598 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,605 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,610 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,613 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,629 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,643 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,656 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,666 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,675 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,682 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,687 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,690 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,693 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,738 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,782 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,796 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,808 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,819 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,828 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,835 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,841 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,844 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,879 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,895 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,907 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,918 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,927 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,935 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,940 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,943 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,970 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,984 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:27,996 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,008 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,018 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,025 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,031 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,034 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,050 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,063 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,076 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,087 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,097 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,104 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,110 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:40:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,113 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:40:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,116 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:40:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,119 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-11-27 20:40:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:28,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:40:28,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010212837] [2024-11-27 20:40:28,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010212837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:40:28,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470702718] [2024-11-27 20:40:28,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:40:28,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:40:28,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:40:28,134 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:40:28,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9089a6ab-d58e-4c04-b660-cd97d3162c48/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 20:40:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:40:45,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 55592 conjuncts, 1173 conjuncts are in the unsatisfiable core [2024-11-27 20:40:45,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:40:45,635 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 [2024-11-27 20:40:46,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-27 20:40:46,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:41:39,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470702718] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:41:39,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:41:39,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 22] total 41 [2024-11-27 20:41:39,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547690088] [2024-11-27 20:41:39,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:41:39,158 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:41:39,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:41:39,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-27 20:41:39,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1364, Unknown=0, NotChecked=0, Total=1640 [2024-11-27 20:41:39,160 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. cyclomatic complexity: 19 Second operand has 41 states, 32 states have (on average 2.8125) internal successors, (90), 31 states have internal predecessors, (90), 17 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (41), 15 states have call predecessors, (41), 17 states have call successors, (41) [2024-11-27 20:41:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:41:39,772 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2024-11-27 20:41:39,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 104 transitions. [2024-11-27 20:41:39,775 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:41:39,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 104 transitions. [2024-11-27 20:41:39,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2024-11-27 20:41:39,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2024-11-27 20:41:39,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 104 transitions. [2024-11-27 20:41:39,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:41:39,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 104 transitions. [2024-11-27 20:41:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 104 transitions. [2024-11-27 20:41:39,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-27 20:41:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 59 states have internal predecessors, (61), 13 states have call successors, (13), 4 states have call predecessors, (13), 21 states have return successors, (30), 26 states have call predecessors, (30), 13 states have call successors, (30) [2024-11-27 20:41:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2024-11-27 20:41:39,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 104 transitions. [2024-11-27 20:41:39,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-27 20:41:39,791 INFO L425 stractBuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2024-11-27 20:41:39,791 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-27 20:41:39,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2024-11-27 20:41:39,792 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 46 [2024-11-27 20:41:39,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:41:39,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:41:39,824 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-27 20:41:39,824 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1890, 1890, 1620, 1620, 1620, 324, 324, 270, 270, 270, 270, 270, 270, 270, 72, 72, 54, 54, 54, 54, 54, 54, 54, 24, 24, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2024-11-27 20:41:39,824 INFO L747 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~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2024-11-27 20:41:39,828 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;" "main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;" "call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#115#return;" "assume true;" >"#121#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#123#return;" "assume true;" >"#127#return;" "call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#129#return;" "assume true;" >"#117#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#119#return;" "assume true;" >"#125#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2024-11-27 20:41:39,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:41:39,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 13 times [2024-11-27 20:41:39,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:41:39,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076625842] [2024-11-27 20:41:39,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:41:39,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:41:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:41:39,923 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:41:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:41:39,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:41:39,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:41:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1284143539, now seen corresponding path program 8 times [2024-11-27 20:41:39,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:41:39,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026095961] [2024-11-27 20:41:39,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:41:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms