./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:37:13,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:37:13,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:37:13,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:37:13,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:37:13,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:37:13,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:37:13,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:37:13,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:37:13,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:37:13,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:37:13,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:37:13,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:37:13,121 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:37:13,121 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:37:13,121 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:37:13,121 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:37:13,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:37:13,122 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:37:13,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:37:13,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:37:13,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:37:13,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:37:13,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:37:13,123 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:37:13,123 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2025-03-17 20:37:13,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:37:13,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:37:13,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:37:13,353 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:37:13,353 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:37:13,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-03-17 20:37:14,523 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50031af7d/8e0f1d5dc86e4d8f9d90b3891e335858/FLAG37f8d7775 [2025-03-17 20:37:14,735 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:37:14,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-03-17 20:37:14,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50031af7d/8e0f1d5dc86e4d8f9d90b3891e335858/FLAG37f8d7775 [2025-03-17 20:37:14,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50031af7d/8e0f1d5dc86e4d8f9d90b3891e335858 [2025-03-17 20:37:14,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:37:14,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:37:14,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:37:14,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:37:14,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:37:14,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:14,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f910bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14, skipping insertion in model container [2025-03-17 20:37:14,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:14,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:37:14,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:37:14,934 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:37:14,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:37:14,966 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:37:14,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14 WrapperNode [2025-03-17 20:37:14,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:37:14,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:37:14,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:37:14,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:37:14,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:14,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:14,993 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2025-03-17 20:37:14,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:37:14,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:37:14,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:37:14,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:37:15,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:15,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:15,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:15,022 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2025-03-17 20:37:15,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:15,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:15,030 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:15,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:15,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:15,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:15,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:37:15,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:37:15,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:37:15,034 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:37:15,035 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (1/1) ... [2025-03-17 20:37:15,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:37:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:37:15,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:37:15,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 20:37:15,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:37:15,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:37:15,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 20:37:15,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 20:37:15,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-03-17 20:37:15,076 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-03-17 20:37:15,076 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-03-17 20:37:15,076 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:37:15,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2025-03-17 20:37:15,076 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2025-03-17 20:37:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-03-17 20:37:15,077 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-03-17 20:37:15,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:37:15,153 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:37:15,154 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:37:15,367 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset;call ULTIMATE.dealloc(main_~#e~0#1.base, main_~#e~0#1.offset);havoc main_~#e~0#1.base, main_~#e~0#1.offset; [2025-03-17 20:37:15,391 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-17 20:37:15,391 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:37:15,401 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:37:15,402 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:37:15,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:37:15 BoogieIcfgContainer [2025-03-17 20:37:15,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:37:15,404 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:37:15,404 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:37:15,407 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:37:15,408 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:37:15,408 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:37:14" (1/3) ... [2025-03-17 20:37:15,409 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1797d671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:37:15, skipping insertion in model container [2025-03-17 20:37:15,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:37:15,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:37:14" (2/3) ... [2025-03-17 20:37:15,411 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1797d671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:37:15, skipping insertion in model container [2025-03-17 20:37:15,411 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:37:15,411 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:37:15" (3/3) ... [2025-03-17 20:37:15,412 INFO L363 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2025-03-17 20:37:15,450 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:37:15,450 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:37:15,450 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:37:15,450 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:37:15,450 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:37:15,450 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:37:15,450 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:37:15,450 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:37:15,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 20:37:15,466 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:15,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:15,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:15,471 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:15,471 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:15,471 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:37:15,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 20:37:15,473 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:15,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:15,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:15,474 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:15,474 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:15,477 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:15,477 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:15,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 1 times [2025-03-17 20:37:15,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:15,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346197698] [2025-03-17 20:37:15,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:37:15,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:15,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:15,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:15,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:15,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:15,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:15,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:15,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:15,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:15,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:15,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:15,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:15,618 INFO L85 PathProgramCache]: Analyzing trace with hash 751668400, now seen corresponding path program 1 times [2025-03-17 20:37:15,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:15,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530226509] [2025-03-17 20:37:15,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:37:15,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:15,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:37:15,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:37:15,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:15,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:37:15,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:15,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530226509] [2025-03-17 20:37:15,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530226509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:37:15,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:37:15,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 20:37:15,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362769007] [2025-03-17 20:37:15,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:37:15,914 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:37:15,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:37:15,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 20:37:15,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 20:37:15,934 INFO L87 Difference]: Start difference. First operand has 48 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 20:37:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:37:16,112 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2025-03-17 20:37:16,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 66 transitions. [2025-03-17 20:37:16,115 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:16,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 35 states and 43 transitions. [2025-03-17 20:37:16,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-03-17 20:37:16,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-03-17 20:37:16,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 43 transitions. [2025-03-17 20:37:16,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:37:16,123 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-17 20:37:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 43 transitions. [2025-03-17 20:37:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-17 20:37:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 24 states have internal predecessors, (24), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-17 20:37:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-17 20:37:16,140 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-17 20:37:16,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:37:16,143 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-17 20:37:16,143 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:37:16,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2025-03-17 20:37:16,144 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:16,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:16,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:16,144 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:16,145 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:16,145 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:16,145 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:16,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 2 times [2025-03-17 20:37:16,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:16,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232321531] [2025-03-17 20:37:16,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:37:16,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:16,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:16,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:16,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:37:16,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:16,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:16,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:16,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:16,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:16,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:16,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:16,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:16,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1990164627, now seen corresponding path program 1 times [2025-03-17 20:37:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:16,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363584439] [2025-03-17 20:37:16,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:37:16,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:16,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:37:16,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:37:16,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:16,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 20:37:16,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:16,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363584439] [2025-03-17 20:37:16,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363584439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:37:16,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:37:16,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 20:37:16,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167046584] [2025-03-17 20:37:16,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:37:16,357 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:37:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:37:16,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 20:37:16,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 20:37:16,359 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 13 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 20:37:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:37:16,497 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2025-03-17 20:37:16,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2025-03-17 20:37:16,498 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:16,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 45 transitions. [2025-03-17 20:37:16,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-17 20:37:16,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-17 20:37:16,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 45 transitions. [2025-03-17 20:37:16,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:37:16,500 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-03-17 20:37:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 45 transitions. [2025-03-17 20:37:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 20:37:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 25 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-17 20:37:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-03-17 20:37:16,503 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-03-17 20:37:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:37:16,505 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-03-17 20:37:16,505 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:37:16,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 45 transitions. [2025-03-17 20:37:16,508 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:16,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:16,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:16,508 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:16,508 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:16,508 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:16,508 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:16,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:16,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 3 times [2025-03-17 20:37:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107441323] [2025-03-17 20:37:16,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:37:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:16,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:16,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:16,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:37:16,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:16,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:16,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:16,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:16,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:16,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:16,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:16,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash -55399640, now seen corresponding path program 1 times [2025-03-17 20:37:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:16,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426387294] [2025-03-17 20:37:16,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:37:16,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:16,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 20:37:16,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 20:37:16,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:16,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 20:37:16,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:16,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426387294] [2025-03-17 20:37:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426387294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:37:16,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:37:16,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 20:37:16,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670204350] [2025-03-17 20:37:16,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:37:16,713 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:37:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:37:16,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 20:37:16,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 20:37:16,713 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. cyclomatic complexity: 13 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 20:37:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:37:16,796 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-03-17 20:37:16,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2025-03-17 20:37:16,797 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:16,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 47 transitions. [2025-03-17 20:37:16,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-03-17 20:37:16,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-03-17 20:37:16,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2025-03-17 20:37:16,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:37:16,799 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-03-17 20:37:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2025-03-17 20:37:16,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 20:37:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 26 states have internal predecessors, (26), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-17 20:37:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-03-17 20:37:16,802 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-03-17 20:37:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:37:16,803 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-03-17 20:37:16,803 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:37:16,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 47 transitions. [2025-03-17 20:37:16,805 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:16,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:16,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:16,805 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:16,807 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:16,807 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:16,807 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:16,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 4 times [2025-03-17 20:37:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:16,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592918159] [2025-03-17 20:37:16,808 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:37:16,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:16,817 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 20:37:16,829 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:16,830 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:37:16,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:16,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:16,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:16,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:16,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:16,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:16,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:16,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1848149126, now seen corresponding path program 1 times [2025-03-17 20:37:16,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:16,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093112625] [2025-03-17 20:37:16,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:37:16,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:16,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 20:37:16,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 20:37:16,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:16,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 20:37:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093112625] [2025-03-17 20:37:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093112625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:37:17,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:37:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 20:37:17,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2939972] [2025-03-17 20:37:17,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:37:17,097 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:37:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:37:17,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 20:37:17,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 20:37:17,098 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. cyclomatic complexity: 13 Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 20:37:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:37:17,176 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2025-03-17 20:37:17,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 49 transitions. [2025-03-17 20:37:17,177 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:17,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 49 transitions. [2025-03-17 20:37:17,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-03-17 20:37:17,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-03-17 20:37:17,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2025-03-17 20:37:17,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:37:17,181 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-17 20:37:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2025-03-17 20:37:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 20:37:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 27 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-17 20:37:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-03-17 20:37:17,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-17 20:37:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:37:17,187 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-17 20:37:17,187 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:37:17,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2025-03-17 20:37:17,188 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:17,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:17,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:17,189 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:17,190 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:17,190 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:17,190 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:17,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 5 times [2025-03-17 20:37:17,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:17,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233362073] [2025-03-17 20:37:17,191 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:37:17,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:17,198 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:17,205 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:17,206 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:37:17,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:17,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:17,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:17,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:17,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:17,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:17,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:17,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:17,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1952613451, now seen corresponding path program 1 times [2025-03-17 20:37:17,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:17,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561163328] [2025-03-17 20:37:17,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:37:17,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:17,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 20:37:17,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 20:37:17,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:17,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 20:37:17,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:17,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561163328] [2025-03-17 20:37:17,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561163328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:37:17,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102450825] [2025-03-17 20:37:17,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:37:17,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:37:17,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:37:17,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:37:17,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 20:37:17,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 20:37:17,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 20:37:17,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:17,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:17,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 20:37:17,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:37:17,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 20:37:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 20:37:17,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:37:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 20:37:18,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102450825] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:37:18,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:37:18,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2025-03-17 20:37:18,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054073827] [2025-03-17 20:37:18,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:37:18,386 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:37:18,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:37:18,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 20:37:18,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-03-17 20:37:18,387 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. cyclomatic complexity: 13 Second operand has 24 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 20 states have internal predecessors, (51), 10 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 20:37:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:37:18,845 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-03-17 20:37:18,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 53 transitions. [2025-03-17 20:37:18,846 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:18,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 53 transitions. [2025-03-17 20:37:18,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-03-17 20:37:18,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-03-17 20:37:18,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 53 transitions. [2025-03-17 20:37:18,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:37:18,847 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-03-17 20:37:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 53 transitions. [2025-03-17 20:37:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-17 20:37:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.16) internal successors, (29), 29 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-17 20:37:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-03-17 20:37:18,850 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-03-17 20:37:18,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 20:37:18,851 INFO L432 stractBuchiCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-03-17 20:37:18,851 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:37:18,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 53 transitions. [2025-03-17 20:37:18,851 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:18,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:18,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:18,853 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:18,853 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:18,853 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:18,853 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:18,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:18,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 6 times [2025-03-17 20:37:18,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:18,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911114168] [2025-03-17 20:37:18,854 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:37:18,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:18,860 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:18,867 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:18,867 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 20:37:18,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:18,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:18,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:18,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:18,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:18,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:18,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:18,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:18,875 INFO L85 PathProgramCache]: Analyzing trace with hash -691122821, now seen corresponding path program 2 times [2025-03-17 20:37:18,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:18,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662813129] [2025-03-17 20:37:18,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:37:18,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:18,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-17 20:37:18,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 20:37:18,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:37:18,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 10 proven. 57 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-17 20:37:19,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662813129] [2025-03-17 20:37:19,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662813129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:37:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840616138] [2025-03-17 20:37:19,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:37:19,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:37:19,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:37:19,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:37:19,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 20:37:19,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-17 20:37:19,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 20:37:19,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:37:19,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:19,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 20:37:19,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:37:19,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 20:37:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-17 20:37:19,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:37:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 20:37:20,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840616138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:37:20,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:37:20,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 33 [2025-03-17 20:37:20,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319444733] [2025-03-17 20:37:20,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:37:20,609 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:37:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:37:20,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 20:37:20,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 20:37:20,610 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. cyclomatic complexity: 13 Second operand has 33 states, 25 states have (on average 2.44) internal successors, (61), 28 states have internal predecessors, (61), 13 states have call successors, (23), 7 states have call predecessors, (23), 11 states have return successors, (24), 11 states have call predecessors, (24), 13 states have call successors, (24) [2025-03-17 20:37:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:37:21,126 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-17 20:37:21,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2025-03-17 20:37:21,127 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:21,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 57 transitions. [2025-03-17 20:37:21,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-03-17 20:37:21,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-03-17 20:37:21,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 57 transitions. [2025-03-17 20:37:21,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:37:21,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-17 20:37:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 57 transitions. [2025-03-17 20:37:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 20:37:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 31 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-17 20:37:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-03-17 20:37:21,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-17 20:37:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 20:37:21,136 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-17 20:37:21,136 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:37:21,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2025-03-17 20:37:21,137 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:21,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:21,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:21,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:21,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:21,139 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:21,139 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:21,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 7 times [2025-03-17 20:37:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:21,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844968906] [2025-03-17 20:37:21,139 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:37:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:21,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:21,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:21,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:21,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:21,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:21,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:21,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:21,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:21,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:21,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:21,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:21,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1953006635, now seen corresponding path program 3 times [2025-03-17 20:37:21,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:21,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541393054] [2025-03-17 20:37:21,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:37:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:21,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 131 statements into 9 equivalence classes. [2025-03-17 20:37:21,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 131 statements. [2025-03-17 20:37:21,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 20:37:21,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-03-17 20:37:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:21,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541393054] [2025-03-17 20:37:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541393054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:37:21,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507523819] [2025-03-17 20:37:21,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:37:21,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:37:21,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:37:21,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:37:21,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 20:37:21,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 131 statements into 9 equivalence classes. [2025-03-17 20:37:21,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 131 statements. [2025-03-17 20:37:21,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 20:37:21,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:21,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 20:37:21,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:37:21,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 20:37:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-03-17 20:37:21,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:37:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-17 20:37:21,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507523819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:37:21,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:37:21,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 20 [2025-03-17 20:37:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611404051] [2025-03-17 20:37:21,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:37:21,987 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:37:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:37:21,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 20:37:21,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-03-17 20:37:21,987 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. cyclomatic complexity: 13 Second operand has 20 states, 15 states have (on average 2.466666666666667) internal successors, (37), 17 states have internal predecessors, (37), 9 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 6 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-17 20:37:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:37:22,234 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2025-03-17 20:37:22,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2025-03-17 20:37:22,235 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:22,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 59 transitions. [2025-03-17 20:37:22,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2025-03-17 20:37:22,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2025-03-17 20:37:22,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 59 transitions. [2025-03-17 20:37:22,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:37:22,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-17 20:37:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 59 transitions. [2025-03-17 20:37:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 20:37:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 32 states have internal predecessors, (32), 10 states have call successors, (10), 5 states have call predecessors, (10), 13 states have return successors, (17), 13 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-17 20:37:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-03-17 20:37:22,242 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-17 20:37:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 20:37:22,243 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-17 20:37:22,243 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:37:22,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2025-03-17 20:37:22,244 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:22,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:22,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:22,248 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:22,248 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 18, 18, 18, 12, 12, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:22,248 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:22,248 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:22,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 8 times [2025-03-17 20:37:22,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:22,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562640119] [2025-03-17 20:37:22,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:37:22,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:22,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:22,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:22,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:37:22,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:22,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:22,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:22,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:22,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:22,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:22,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:22,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash -104818586, now seen corresponding path program 4 times [2025-03-17 20:37:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:22,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133191434] [2025-03-17 20:37:22,275 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:37:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:22,321 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 253 statements into 2 equivalence classes. [2025-03-17 20:37:22,348 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-17 20:37:22,348 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 20:37:22,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1738 backedges. 16 proven. 435 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2025-03-17 20:37:23,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:23,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133191434] [2025-03-17 20:37:23,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133191434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:37:23,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081626566] [2025-03-17 20:37:23,531 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:37:23,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:37:23,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:37:23,535 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:37:23,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 20:37:23,643 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 253 statements into 2 equivalence classes. [2025-03-17 20:37:23,789 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-17 20:37:23,790 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 20:37:23,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:23,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 1706 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 20:37:23,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:37:23,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 20:37:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1738 backedges. 484 proven. 3 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2025-03-17 20:37:23,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:37:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1738 backedges. 10 proven. 124 refuted. 0 times theorem prover too weak. 1604 trivial. 0 not checked. [2025-03-17 20:37:24,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081626566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:37:24,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:37:24,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 30 [2025-03-17 20:37:24,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721590522] [2025-03-17 20:37:24,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:37:24,946 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:37:24,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:37:24,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 20:37:24,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-03-17 20:37:24,947 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. cyclomatic complexity: 13 Second operand has 30 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 26 states have internal predecessors, (71), 12 states have call successors, (29), 6 states have call predecessors, (29), 10 states have return successors, (31), 9 states have call predecessors, (31), 12 states have call successors, (31) [2025-03-17 20:37:25,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:37:25,388 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2025-03-17 20:37:25,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 63 transitions. [2025-03-17 20:37:25,389 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:25,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 63 transitions. [2025-03-17 20:37:25,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-03-17 20:37:25,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-03-17 20:37:25,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2025-03-17 20:37:25,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:37:25,390 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 63 transitions. [2025-03-17 20:37:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2025-03-17 20:37:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-17 20:37:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 34 states have internal predecessors, (34), 10 states have call successors, (10), 5 states have call predecessors, (10), 15 states have return successors, (19), 15 states have call predecessors, (19), 8 states have call successors, (19) [2025-03-17 20:37:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2025-03-17 20:37:25,397 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 63 transitions. [2025-03-17 20:37:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 20:37:25,397 INFO L432 stractBuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2025-03-17 20:37:25,398 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:37:25,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 63 transitions. [2025-03-17 20:37:25,398 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:25,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:25,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:25,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:25,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [60, 60, 48, 48, 48, 18, 18, 12, 12, 12, 12, 12, 12, 12, 8, 8, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:25,403 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:25,404 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:25,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:25,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 9 times [2025-03-17 20:37:25,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:25,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042979604] [2025-03-17 20:37:25,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:37:25,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:25,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:25,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:25,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:37:25,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:25,417 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:25,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:25,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:25,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:25,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:25,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:25,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash 346251128, now seen corresponding path program 5 times [2025-03-17 20:37:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:25,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221746139] [2025-03-17 20:37:25,429 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:37:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:25,481 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 469 statements into 12 equivalence classes. [2025-03-17 20:37:25,536 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 186 of 469 statements. [2025-03-17 20:37:25,536 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 20:37:25,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9190 backedges. 14 proven. 1383 refuted. 0 times theorem prover too weak. 7793 trivial. 0 not checked. [2025-03-17 20:37:26,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:26,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221746139] [2025-03-17 20:37:26,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221746139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:37:26,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404734007] [2025-03-17 20:37:26,344 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:37:26,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:37:26,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:37:26,347 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:37:26,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 20:37:26,501 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 469 statements into 12 equivalence classes. [2025-03-17 20:37:27,001 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 186 of 469 statements. [2025-03-17 20:37:27,001 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 20:37:27,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:27,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-17 20:37:27,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:37:27,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 20:37:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9190 backedges. 1345 proven. 24 refuted. 0 times theorem prover too weak. 7821 trivial. 0 not checked. [2025-03-17 20:37:27,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:37:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9190 backedges. 14 proven. 1405 refuted. 0 times theorem prover too weak. 7771 trivial. 0 not checked. [2025-03-17 20:37:29,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404734007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:37:29,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:37:29,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 22] total 34 [2025-03-17 20:37:29,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554277235] [2025-03-17 20:37:29,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:37:29,366 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:37:29,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:37:29,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 20:37:29,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 20:37:29,367 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. cyclomatic complexity: 13 Second operand has 34 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 28 states have internal predecessors, (70), 10 states have call successors, (27), 8 states have call predecessors, (27), 12 states have return successors, (35), 10 states have call predecessors, (35), 10 states have call successors, (35) [2025-03-17 20:37:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:37:29,700 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-03-17 20:37:29,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 65 transitions. [2025-03-17 20:37:29,701 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:29,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 65 transitions. [2025-03-17 20:37:29,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-03-17 20:37:29,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-03-17 20:37:29,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2025-03-17 20:37:29,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:37:29,702 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-03-17 20:37:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2025-03-17 20:37:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-17 20:37:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 5 states have call predecessors, (10), 16 states have return successors, (20), 16 states have call predecessors, (20), 8 states have call successors, (20) [2025-03-17 20:37:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-03-17 20:37:29,705 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-03-17 20:37:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 20:37:29,706 INFO L432 stractBuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-03-17 20:37:29,706 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:37:29,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 65 transitions. [2025-03-17 20:37:29,707 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:29,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:29,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:29,709 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:29,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [72, 72, 60, 60, 60, 18, 18, 12, 12, 12, 12, 12, 12, 12, 8, 8, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:29,709 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:29,709 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:29,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:29,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 10 times [2025-03-17 20:37:29,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:29,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124676260] [2025-03-17 20:37:29,712 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:37:29,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:29,717 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 20:37:29,747 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:29,747 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:37:29,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:29,751 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:29,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:29,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:29,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:29,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:29,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:29,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:29,762 INFO L85 PathProgramCache]: Analyzing trace with hash 872381084, now seen corresponding path program 6 times [2025-03-17 20:37:29,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:29,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029943505] [2025-03-17 20:37:29,763 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:37:29,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:29,805 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 529 statements into 13 equivalence classes. [2025-03-17 20:37:29,822 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 67 of 529 statements. [2025-03-17 20:37:29,822 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 20:37:29,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12976 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12968 trivial. 0 not checked. [2025-03-17 20:37:30,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:30,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029943505] [2025-03-17 20:37:30,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029943505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:37:30,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428811690] [2025-03-17 20:37:30,059 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:37:30,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:37:30,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:37:30,061 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:37:30,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 20:37:30,247 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 529 statements into 13 equivalence classes. [2025-03-17 20:37:30,317 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 67 of 529 statements. [2025-03-17 20:37:30,317 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 20:37:30,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:30,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 20:37:30,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:37:30,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 20:37:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12976 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12968 trivial. 0 not checked. [2025-03-17 20:37:30,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:37:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12976 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12961 trivial. 0 not checked. [2025-03-17 20:37:31,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428811690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:37:31,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:37:31,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 14] total 24 [2025-03-17 20:37:31,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673976175] [2025-03-17 20:37:31,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:37:31,872 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:37:31,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:37:31,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 20:37:31,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2025-03-17 20:37:31,873 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. cyclomatic complexity: 13 Second operand has 24 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 20 states have internal predecessors, (40), 11 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2025-03-17 20:37:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:37:32,091 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-03-17 20:37:32,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 67 transitions. [2025-03-17 20:37:32,091 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:32,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 67 transitions. [2025-03-17 20:37:32,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2025-03-17 20:37:32,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2025-03-17 20:37:32,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 67 transitions. [2025-03-17 20:37:32,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:37:32,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-03-17 20:37:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 67 transitions. [2025-03-17 20:37:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 20:37:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 5 states have call predecessors, (10), 17 states have return successors, (21), 17 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-17 20:37:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2025-03-17 20:37:32,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-03-17 20:37:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 20:37:32,102 INFO L432 stractBuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-03-17 20:37:32,102 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 20:37:32,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 67 transitions. [2025-03-17 20:37:32,102 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:32,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:32,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:32,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:32,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [108, 108, 90, 90, 90, 27, 27, 18, 18, 18, 18, 18, 18, 18, 12, 12, 9, 9, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:32,105 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:32,105 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:32,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 11 times [2025-03-17 20:37:32,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:32,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283743814] [2025-03-17 20:37:32,108 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:37:32,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:32,113 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:32,117 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:32,117 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:37:32,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:32,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:32,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:32,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:32,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:32,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:32,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:32,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1767269998, now seen corresponding path program 7 times [2025-03-17 20:37:32,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:32,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132666831] [2025-03-17 20:37:32,125 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:37:32,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:32,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-17 20:37:32,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-17 20:37:32,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:32,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 29385 backedges. 24 proven. 3043 refuted. 0 times theorem prover too weak. 26318 trivial. 0 not checked. [2025-03-17 20:37:36,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:36,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132666831] [2025-03-17 20:37:36,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132666831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:37:36,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471226163] [2025-03-17 20:37:36,623 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:37:36,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:37:36,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:37:36,625 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:37:36,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 20:37:36,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-17 20:37:37,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-17 20:37:37,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:37,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:37,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 4774 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 20:37:37,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:37:37,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 20:37:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 29385 backedges. 5830 proven. 8 refuted. 0 times theorem prover too weak. 23547 trivial. 0 not checked. [2025-03-17 20:37:37,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:37:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 29385 backedges. 12 proven. 443 refuted. 0 times theorem prover too weak. 28930 trivial. 0 not checked. [2025-03-17 20:37:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471226163] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:37:39,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:37:39,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 14] total 35 [2025-03-17 20:37:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558407093] [2025-03-17 20:37:39,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:37:39,770 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:37:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:37:39,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 20:37:39,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 20:37:39,771 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. cyclomatic complexity: 13 Second operand has 35 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 30 states have internal predecessors, (75), 13 states have call successors, (30), 7 states have call predecessors, (30), 14 states have return successors, (35), 14 states have call predecessors, (35), 13 states have call successors, (35) [2025-03-17 20:37:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:37:40,277 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-03-17 20:37:40,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 71 transitions. [2025-03-17 20:37:40,278 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:40,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 71 transitions. [2025-03-17 20:37:40,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-03-17 20:37:40,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2025-03-17 20:37:40,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 71 transitions. [2025-03-17 20:37:40,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:37:40,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-03-17 20:37:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 71 transitions. [2025-03-17 20:37:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 20:37:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 5 states have call predecessors, (10), 19 states have return successors, (23), 19 states have call predecessors, (23), 8 states have call successors, (23) [2025-03-17 20:37:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2025-03-17 20:37:40,282 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-03-17 20:37:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 20:37:40,286 INFO L432 stractBuchiCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-03-17 20:37:40,286 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 20:37:40,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 71 transitions. [2025-03-17 20:37:40,286 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:40,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:40,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:40,291 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:40,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [189, 189, 162, 162, 162, 36, 36, 27, 27, 27, 27, 27, 27, 27, 12, 12, 9, 9, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:40,291 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:40,292 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:40,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:40,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 12 times [2025-03-17 20:37:40,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:40,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813549603] [2025-03-17 20:37:40,294 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:37:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:40,303 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:40,311 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:40,311 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 20:37:40,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:40,311 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:40,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:40,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:40,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:40,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:40,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:40,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:40,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2047388208, now seen corresponding path program 8 times [2025-03-17 20:37:40,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:40,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922136431] [2025-03-17 20:37:40,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:37:40,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:40,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1248 statements into 2 equivalence classes. [2025-03-17 20:37:40,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1248 of 1248 statements. [2025-03-17 20:37:40,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:37:40,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 88083 backedges. 20 proven. 787 refuted. 0 times theorem prover too weak. 87276 trivial. 0 not checked. [2025-03-17 20:37:46,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:46,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922136431] [2025-03-17 20:37:46,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922136431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:37:46,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341368285] [2025-03-17 20:37:46,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:37:46,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:37:46,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:37:46,847 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:37:46,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 20:37:47,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1248 statements into 2 equivalence classes. [2025-03-17 20:37:47,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1248 of 1248 statements. [2025-03-17 20:37:47,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:37:47,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:47,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 7294 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 20:37:47,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:37:47,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 20:37:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 88083 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 88068 trivial. 0 not checked. [2025-03-17 20:37:48,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:37:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 88083 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 88050 trivial. 0 not checked. [2025-03-17 20:37:51,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341368285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:37:51,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:37:51,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 18] total 40 [2025-03-17 20:37:51,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106792596] [2025-03-17 20:37:51,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:37:51,531 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:37:51,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:37:51,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 20:37:51,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1355, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 20:37:51,532 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. cyclomatic complexity: 13 Second operand has 40 states, 31 states have (on average 2.096774193548387) internal successors, (65), 34 states have internal predecessors, (65), 17 states have call successors, (26), 8 states have call predecessors, (26), 14 states have return successors, (29), 17 states have call predecessors, (29), 17 states have call successors, (29) [2025-03-17 20:37:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:37:52,196 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2025-03-17 20:37:52,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 75 transitions. [2025-03-17 20:37:52,197 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:52,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 75 transitions. [2025-03-17 20:37:52,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-03-17 20:37:52,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-03-17 20:37:52,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 75 transitions. [2025-03-17 20:37:52,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:37:52,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 75 transitions. [2025-03-17 20:37:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 75 transitions. [2025-03-17 20:37:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-17 20:37:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 40 states have internal predecessors, (40), 10 states have call successors, (10), 5 states have call predecessors, (10), 21 states have return successors, (25), 21 states have call predecessors, (25), 8 states have call successors, (25) [2025-03-17 20:37:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2025-03-17 20:37:52,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 75 transitions. [2025-03-17 20:37:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 20:37:52,205 INFO L432 stractBuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2025-03-17 20:37:52,205 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 20:37:52,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 75 transitions. [2025-03-17 20:37:52,205 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:37:52,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:37:52,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:37:52,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:37:52,213 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [336, 336, 288, 288, 288, 60, 60, 48, 48, 48, 48, 48, 48, 48, 16, 16, 12, 12, 12, 12, 12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:37:52,213 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:37:52,214 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:37:52,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:52,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 13 times [2025-03-17 20:37:52,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:52,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603412990] [2025-03-17 20:37:52,216 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:37:52,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:52,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:52,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:52,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:52,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:52,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:37:52,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:37:52,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:37:52,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:37:52,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:37:52,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:37:52,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:37:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2062008064, now seen corresponding path program 9 times [2025-03-17 20:37:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:37:52,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649489608] [2025-03-17 20:37:52,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:37:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:37:52,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2153 statements into 90 equivalence classes. [2025-03-17 20:37:52,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 159 of 2153 statements. [2025-03-17 20:37:52,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 20:37:52,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 277648 backedges. 296 proven. 17 refuted. 0 times theorem prover too weak. 277335 trivial. 0 not checked. [2025-03-17 20:37:53,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:37:53,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649489608] [2025-03-17 20:37:53,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649489608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:37:53,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203850549] [2025-03-17 20:37:53,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:37:53,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:37:53,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:37:53,129 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:37:53,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 20:37:53,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2153 statements into 90 equivalence classes. [2025-03-17 20:37:53,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 159 of 2153 statements. [2025-03-17 20:37:53,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 20:37:53,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:37:53,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 20:37:53,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:37:54,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 20:37:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 277648 backedges. 290 proven. 15 refuted. 0 times theorem prover too weak. 277343 trivial. 0 not checked. [2025-03-17 20:37:54,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:38:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 277648 backedges. 290 proven. 33 refuted. 0 times theorem prover too weak. 277325 trivial. 0 not checked. [2025-03-17 20:38:00,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203850549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:38:00,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:38:00,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 18] total 33 [2025-03-17 20:38:00,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192997406] [2025-03-17 20:38:00,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:38:00,811 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:38:00,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:38:00,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 20:38:00,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 20:38:00,812 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. cyclomatic complexity: 13 Second operand has 33 states, 25 states have (on average 2.36) internal successors, (59), 28 states have internal predecessors, (59), 15 states have call successors, (24), 7 states have call predecessors, (24), 11 states have return successors, (27), 14 states have call predecessors, (27), 15 states have call successors, (27) [2025-03-17 20:38:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:38:01,101 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2025-03-17 20:38:01,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 79 transitions. [2025-03-17 20:38:01,102 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:38:01,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 79 transitions. [2025-03-17 20:38:01,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2025-03-17 20:38:01,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2025-03-17 20:38:01,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 79 transitions. [2025-03-17 20:38:01,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:38:01,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-17 20:38:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 79 transitions. [2025-03-17 20:38:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 20:38:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 38 states have (on average 1.105263157894737) internal successors, (42), 42 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 23 states have return successors, (27), 23 states have call predecessors, (27), 8 states have call successors, (27) [2025-03-17 20:38:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2025-03-17 20:38:01,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-17 20:38:01,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 20:38:01,113 INFO L432 stractBuchiCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-17 20:38:01,113 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 20:38:01,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 79 transitions. [2025-03-17 20:38:01,113 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-17 20:38:01,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:38:01,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:38:01,120 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:38:01,121 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [560, 560, 480, 480, 480, 100, 100, 80, 80, 80, 80, 80, 80, 80, 24, 24, 20, 20, 20, 20, 20, 20, 20, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:38:01,121 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#2(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-17 20:38:01,122 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#5(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#63#return;" "assume true;" >"#67#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#61#return;" "call #t~mem11 := read~int#4(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#4(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#59#return;" "assume true;" >"#57#return;" "call #t~mem14 := read~int#5(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#5(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#5(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#55#return;" "assume true;" >"#71#return;" "call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-17 20:38:01,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:38:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2645, now seen corresponding path program 14 times [2025-03-17 20:38:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:38:01,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581995787] [2025-03-17 20:38:01,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:38:01,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:38:01,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:38:01,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:38:01,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:38:01,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:38:01,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:38:01,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:38:01,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:38:01,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:38:01,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:38:01,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:38:01,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:38:01,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1040150672, now seen corresponding path program 10 times [2025-03-17 20:38:01,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:38:01,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226782350] [2025-03-17 20:38:01,146 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:38:01,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:38:01,508 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3553 statements into 2 equivalence classes. [2025-03-17 20:38:03,798 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 3553 of 3553 statements. [2025-03-17 20:38:03,798 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 20:38:03,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat