./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-10 07:51:03,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:51:03,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:51:03,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:51:03,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:51:03,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:51:03,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:51:03,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:51:03,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:51:03,715 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:51:03,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:51:03,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:51:03,717 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:51:03,717 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:51:03,717 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:51:03,717 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:51:03,717 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:51:03,717 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:51:03,717 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:51:03,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:51:03,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:51:03,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:51:03,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:51:03,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:51:03,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:51:03,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:51:03,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:51:03,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:51:03,718 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:51:03,718 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:51:03,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:51:03,718 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:51:03,719 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:51:03,719 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:51:03,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:51:03,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:51:03,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:51:03,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:51:03,719 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:51:03,719 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-jdk21/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-01-10 07:51:03,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:51:03,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:51:03,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:51:03,933 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:51:03,933 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:51:03,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-01-10 07:51:05,096 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa798b3ce/7ccd68f746aa42ab885f297c6372fa67/FLAG8f12215f5 [2025-01-10 07:51:05,335 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:51:05,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-01-10 07:51:05,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa798b3ce/7ccd68f746aa42ab885f297c6372fa67/FLAG8f12215f5 [2025-01-10 07:51:05,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa798b3ce/7ccd68f746aa42ab885f297c6372fa67 [2025-01-10 07:51:05,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:51:05,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:51:05,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:51:05,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:51:05,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:51:05,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d912b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05, skipping insertion in model container [2025-01-10 07:51:05,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:51:05,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:51:05,523 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:51:05,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:51:05,549 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:51:05,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05 WrapperNode [2025-01-10 07:51:05,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:51:05,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:51:05,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:51:05,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:51:05,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,569 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2025-01-10 07:51:05,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:51:05,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:51:05,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:51:05,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:51:05,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,599 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-01-10 07:51:05,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,605 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:51:05,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:51:05,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:51:05,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:51:05,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (1/1) ... [2025-01-10 07:51:05,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:51:05,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:05,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:51:05,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 07:51:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-01-10 07:51:05,655 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-01-10 07:51:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-01-10 07:51:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-01-10 07:51:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-01-10 07:51:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-01-10 07:51:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:51:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:51:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:51:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:51:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:51:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 07:51:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 07:51:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 07:51:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2025-01-10 07:51:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2025-01-10 07:51:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-01-10 07:51:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-01-10 07:51:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:51:05,734 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:51:05,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:51:05,961 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-10 07:51:05,961 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:51:05,969 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:51:05,969 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:51:05,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:51:05 BoogieIcfgContainer [2025-01-10 07:51:05,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:51:05,970 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:51:05,970 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:51:05,973 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:51:05,974 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:51:05,974 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:51:05" (1/3) ... [2025-01-10 07:51:05,975 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f0576f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:51:05, skipping insertion in model container [2025-01-10 07:51:05,975 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:51:05,975 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:05" (2/3) ... [2025-01-10 07:51:05,975 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f0576f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:51:05, skipping insertion in model container [2025-01-10 07:51:05,975 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:51:05,975 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:51:05" (3/3) ... [2025-01-10 07:51:05,976 INFO L363 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2025-01-10 07:51:06,009 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:51:06,009 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:51:06,009 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:51:06,009 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:51:06,009 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:51:06,009 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:51:06,009 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:51:06,009 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:51:06,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 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-01-10 07:51:06,027 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:06,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:06,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:06,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:06,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:51:06,032 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:51:06,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 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-01-10 07:51:06,034 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:06,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:06,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:06,035 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:06,035 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:51:06,039 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:51:06,040 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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:51:06,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:06,043 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 1 times [2025-01-10 07:51:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:06,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307026788] [2025-01-10 07:51:06,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:06,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:06,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:06,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:06,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:06,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:06,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:06,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:06,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:06,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:06,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:06,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2053320187, now seen corresponding path program 1 times [2025-01-10 07:51:06,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:06,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126971568] [2025-01-10 07:51:06,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:06,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:06,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:51:06,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:51:06,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:06,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:51:06,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:06,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126971568] [2025-01-10 07:51:06,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126971568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:51:06,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:51:06,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 07:51:06,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896045933] [2025-01-10 07:51:06,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:51:06,558 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:06,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:06,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:51:06,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:51:06,577 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 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-01-10 07:51:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:06,774 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-01-10 07:51:06,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2025-01-10 07:51:06,777 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:06,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 44 transitions. [2025-01-10 07:51:06,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-01-10 07:51:06,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-01-10 07:51:06,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2025-01-10 07:51:06,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:06,790 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-01-10 07:51:06,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2025-01-10 07:51:06,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-10 07:51:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 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), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-10 07:51:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-01-10 07:51:06,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-01-10 07:51:06,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:51:06,815 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-01-10 07:51:06,817 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:51:06,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2025-01-10 07:51:06,818 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:06,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:06,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:06,820 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:06,820 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-01-10 07:51:06,820 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:51:06,820 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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:51:06,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 2 times [2025-01-10 07:51:06,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:06,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883069142] [2025-01-10 07:51:06,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:51:06,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:06,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:06,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:06,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:51:06,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:06,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:06,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:06,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:06,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:06,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:06,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:06,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:06,874 INFO L85 PathProgramCache]: Analyzing trace with hash 54735792, now seen corresponding path program 1 times [2025-01-10 07:51:06,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:06,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648326859] [2025-01-10 07:51:06,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:06,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:06,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 07:51:06,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 07:51:06,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:06,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:51:07,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:07,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648326859] [2025-01-10 07:51:07,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648326859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:51:07,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:51:07,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 07:51:07,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858919666] [2025-01-10 07:51:07,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:51:07,095 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:07,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:07,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:51:07,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:51:07,096 INFO L87 Difference]: Start difference. First operand 36 states and 44 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-01-10 07:51:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:07,238 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-01-10 07:51:07,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2025-01-10 07:51:07,239 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:07,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 46 transitions. [2025-01-10 07:51:07,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-01-10 07:51:07,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-01-10 07:51:07,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2025-01-10 07:51:07,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:07,240 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-01-10 07:51:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2025-01-10 07:51:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-10 07:51:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 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), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-10 07:51:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-01-10 07:51:07,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-01-10 07:51:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:51:07,246 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-01-10 07:51:07,246 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:51:07,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2025-01-10 07:51:07,247 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:07,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:07,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:07,247 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:07,247 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-01-10 07:51:07,247 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:51:07,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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:51:07,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 3 times [2025-01-10 07:51:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:07,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913624470] [2025-01-10 07:51:07,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:51:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:07,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:07,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:07,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:51:07,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:07,269 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:07,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:07,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:07,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:07,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:07,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:07,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1525796123, now seen corresponding path program 1 times [2025-01-10 07:51:07,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:07,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817918080] [2025-01-10 07:51:07,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:07,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 07:51:07,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:51:07,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:07,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 07:51:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817918080] [2025-01-10 07:51:07,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817918080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:51:07,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:51:07,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 07:51:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857511024] [2025-01-10 07:51:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:51:07,479 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:07,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:51:07,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:51:07,480 INFO L87 Difference]: Start difference. First operand 38 states and 46 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-01-10 07:51:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:07,581 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-01-10 07:51:07,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2025-01-10 07:51:07,582 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:07,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 48 transitions. [2025-01-10 07:51:07,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-01-10 07:51:07,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-01-10 07:51:07,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2025-01-10 07:51:07,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:07,583 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-01-10 07:51:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2025-01-10 07:51:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-10 07:51:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 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), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-01-10 07:51:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-01-10 07:51:07,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-01-10 07:51:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:51:07,587 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-01-10 07:51:07,587 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:51:07,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2025-01-10 07:51:07,599 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:07,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:07,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:07,603 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:07,603 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-01-10 07:51:07,604 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:51:07,604 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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:51:07,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 4 times [2025-01-10 07:51:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:07,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071154887] [2025-01-10 07:51:07,604 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:51:07,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:07,617 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-01-10 07:51:07,625 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:07,625 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:51:07,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:07,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:07,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:07,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:07,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:07,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:07,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:07,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1439872263, now seen corresponding path program 1 times [2025-01-10 07:51:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:07,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627543610] [2025-01-10 07:51:07,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:07,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:07,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 07:51:07,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 07:51:07,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:07,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 07:51:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627543610] [2025-01-10 07:51:07,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627543610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:51:07,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:51:07,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 07:51:07,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943180500] [2025-01-10 07:51:07,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:51:07,863 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:07,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:07,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:51:07,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:51:07,864 INFO L87 Difference]: Start difference. First operand 40 states and 48 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-01-10 07:51:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:07,947 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-01-10 07:51:07,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2025-01-10 07:51:07,948 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:07,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2025-01-10 07:51:07,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-01-10 07:51:07,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-01-10 07:51:07,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2025-01-10 07:51:07,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:07,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-01-10 07:51:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2025-01-10 07:51:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-10 07:51:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 28 states have internal predecessors, (28), 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-01-10 07:51:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-01-10 07:51:07,954 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-01-10 07:51:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:51:07,955 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-01-10 07:51:07,955 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:51:07,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2025-01-10 07:51:07,956 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:07,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:07,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:07,957 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:07,957 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-01-10 07:51:07,957 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:51:07,957 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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:51:07,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:07,958 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 5 times [2025-01-10 07:51:07,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:07,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979892804] [2025-01-10 07:51:07,958 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:51:07,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:07,965 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:07,972 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:07,972 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:51:07,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:07,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:07,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:07,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:07,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:07,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:07,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:07,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:07,986 INFO L85 PathProgramCache]: Analyzing trace with hash 405682375, now seen corresponding path program 1 times [2025-01-10 07:51:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979478128] [2025-01-10 07:51:07,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:08,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 07:51:08,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 07:51:08,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:08,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 07:51:08,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:08,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979478128] [2025-01-10 07:51:08,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979478128] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:08,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438579553] [2025-01-10 07:51:08,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:08,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:08,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:08,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:08,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 07:51:08,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 07:51:08,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 07:51:08,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:08,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:08,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 07:51:08,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:08,547 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-01-10 07:51:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:51:08,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 07:51:09,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438579553] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:09,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:09,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 26 [2025-01-10 07:51:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216078962] [2025-01-10 07:51:09,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:09,287 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:09,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:09,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 07:51:09,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-01-10 07:51:09,288 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand has 26 states, 20 states have (on average 2.7) internal successors, (54), 22 states have internal predecessors, (54), 11 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2025-01-10 07:51:09,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:09,737 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-01-10 07:51:09,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2025-01-10 07:51:09,738 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:09,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2025-01-10 07:51:09,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2025-01-10 07:51:09,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-01-10 07:51:09,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2025-01-10 07:51:09,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:09,739 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-01-10 07:51:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2025-01-10 07:51:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-10 07:51:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 30 states have internal predecessors, (30), 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-01-10 07:51:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-01-10 07:51:09,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-01-10 07:51:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 07:51:09,746 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-01-10 07:51:09,746 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:51:09,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2025-01-10 07:51:09,746 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:09,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:09,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:09,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:09,747 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:51:09,747 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:51:09,748 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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:51:09,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 6 times [2025-01-10 07:51:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:09,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417000248] [2025-01-10 07:51:09,748 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:51:09,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:09,756 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:09,768 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:09,769 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:51:09,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:09,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:09,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:09,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:09,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:09,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:09,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:09,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash 688040901, now seen corresponding path program 2 times [2025-01-10 07:51:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:09,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956315049] [2025-01-10 07:51:09,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:51:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:09,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-10 07:51:09,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 07:51:09,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:51:09,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 07:51:10,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:10,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956315049] [2025-01-10 07:51:10,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956315049] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:10,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660910958] [2025-01-10 07:51:10,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:51:10,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:10,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:10,320 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:10,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 07:51:10,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-10 07:51:10,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 07:51:10,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:51:10,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:10,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 07:51:10,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:10,449 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-01-10 07:51:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-10 07:51:10,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-10 07:51:10,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660910958] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:10,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:10,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 27 [2025-01-10 07:51:10,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708969791] [2025-01-10 07:51:10,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:10,985 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:10,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:10,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-10 07:51:10,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-01-10 07:51:10,986 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 27 states, 20 states have (on average 2.65) internal successors, (53), 23 states have internal predecessors, (53), 11 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2025-01-10 07:51:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:11,479 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-01-10 07:51:11,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2025-01-10 07:51:11,480 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:11,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2025-01-10 07:51:11,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-01-10 07:51:11,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-01-10 07:51:11,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2025-01-10 07:51:11,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:11,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-01-10 07:51:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2025-01-10 07:51:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 07:51:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 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), 12 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2025-01-10 07:51:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-01-10 07:51:11,487 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-01-10 07:51:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 07:51:11,489 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-01-10 07:51:11,489 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:51:11,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2025-01-10 07:51:11,490 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:11,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:11,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:11,492 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:11,492 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:51:11,492 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:51:11,492 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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:51:11,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:11,494 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 7 times [2025-01-10 07:51:11,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:11,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035724321] [2025-01-10 07:51:11,494 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:51:11,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:11,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:11,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:11,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:11,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:11,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:11,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:11,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:11,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:11,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:11,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:11,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1402936395, now seen corresponding path program 3 times [2025-01-10 07:51:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:11,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400378560] [2025-01-10 07:51:11,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:51:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:11,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 157 statements into 9 equivalence classes. [2025-01-10 07:51:11,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 157 statements. [2025-01-10 07:51:11,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 07:51:11,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-01-10 07:51:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400378560] [2025-01-10 07:51:11,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400378560] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:11,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525819591] [2025-01-10 07:51:11,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:51:11,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:11,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:11,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:11,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 07:51:11,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 157 statements into 9 equivalence classes. [2025-01-10 07:51:11,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 157 statements. [2025-01-10 07:51:11,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 07:51:11,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:11,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 07:51:11,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:11,935 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-01-10 07:51:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-01-10 07:51:12,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-01-10 07:51:12,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525819591] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:12,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:12,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 14] total 29 [2025-01-10 07:51:12,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131300407] [2025-01-10 07:51:12,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:12,985 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:12,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:12,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-10 07:51:12,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2025-01-10 07:51:12,986 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 29 states, 22 states have (on average 2.409090909090909) internal successors, (53), 24 states have internal predecessors, (53), 13 states have call successors, (21), 7 states have call predecessors, (21), 10 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21) [2025-01-10 07:51:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:13,427 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2025-01-10 07:51:13,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 62 transitions. [2025-01-10 07:51:13,428 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:13,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 62 transitions. [2025-01-10 07:51:13,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-01-10 07:51:13,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-01-10 07:51:13,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 62 transitions. [2025-01-10 07:51:13,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:13,429 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-01-10 07:51:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 62 transitions. [2025-01-10 07:51:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-10 07:51:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 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), 14 states have return successors, (18), 14 states have call predecessors, (18), 8 states have call successors, (18) [2025-01-10 07:51:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2025-01-10 07:51:13,432 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-01-10 07:51:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 07:51:13,432 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-01-10 07:51:13,432 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:51:13,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2025-01-10 07:51:13,433 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:13,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:13,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:13,437 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:13,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 36, 36, 36, 18, 18, 12, 12, 12, 12, 12, 12, 12, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:51:13,438 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:51:13,438 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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:51:13,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 8 times [2025-01-10 07:51:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:13,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529509389] [2025-01-10 07:51:13,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:51:13,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:13,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:13,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:13,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:51:13,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:13,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:13,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:13,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:13,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:13,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:13,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:13,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:13,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1747404074, now seen corresponding path program 4 times [2025-01-10 07:51:13,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:13,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117179460] [2025-01-10 07:51:13,461 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:51:13,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:13,505 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 420 statements into 2 equivalence classes. [2025-01-10 07:51:13,568 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-01-10 07:51:13,568 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 07:51:13,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6174 backedges. 183 proven. 124 refuted. 0 times theorem prover too weak. 5867 trivial. 0 not checked. [2025-01-10 07:51:15,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:15,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117179460] [2025-01-10 07:51:15,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117179460] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:15,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165119945] [2025-01-10 07:51:15,152 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:51:15,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:15,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:15,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:15,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 07:51:15,311 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 420 statements into 2 equivalence classes. [2025-01-10 07:51:15,525 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-01-10 07:51:15,525 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 07:51:15,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:15,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 2680 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-01-10 07:51:15,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:15,578 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-01-10 07:51:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6174 backedges. 877 proven. 15 refuted. 0 times theorem prover too weak. 5282 trivial. 0 not checked. [2025-01-10 07:51:15,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6174 backedges. 14 proven. 919 refuted. 0 times theorem prover too weak. 5241 trivial. 0 not checked. [2025-01-10 07:51:17,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165119945] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:17,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:17,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 18] total 40 [2025-01-10 07:51:17,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629309204] [2025-01-10 07:51:17,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:17,782 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:17,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:17,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-10 07:51:17,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1366, Unknown=0, NotChecked=0, Total=1560 [2025-01-10 07:51:17,784 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 13 Second operand has 40 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (32), 8 states have call predecessors, (32), 13 states have return successors, (37), 12 states have call predecessors, (37), 15 states have call successors, (37) [2025-01-10 07:51:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:18,441 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2025-01-10 07:51:18,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2025-01-10 07:51:18,442 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:18,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2025-01-10 07:51:18,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-01-10 07:51:18,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-01-10 07:51:18,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2025-01-10 07:51:18,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:18,443 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-01-10 07:51:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2025-01-10 07:51:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-10 07:51:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 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), 16 states have return successors, (20), 16 states have call predecessors, (20), 8 states have call successors, (20) [2025-01-10 07:51:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2025-01-10 07:51:18,449 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-01-10 07:51:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 07:51:18,452 INFO L432 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-01-10 07:51:18,452 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:51:18,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2025-01-10 07:51:18,453 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:18,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:18,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:18,458 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:18,458 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [90, 90, 72, 72, 72, 24, 24, 18, 18, 18, 18, 18, 18, 18, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:51:18,458 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:51:18,458 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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:51:18,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:18,461 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 9 times [2025-01-10 07:51:18,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:18,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949510166] [2025-01-10 07:51:18,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:51:18,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:18,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:18,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:18,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:51:18,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:18,469 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:18,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:18,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:18,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:18,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:18,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:18,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash -386466074, now seen corresponding path program 5 times [2025-01-10 07:51:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:18,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249110341] [2025-01-10 07:51:18,476 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:51:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:18,520 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 666 statements into 13 equivalence classes. [2025-01-10 07:51:18,647 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 334 of 666 statements. [2025-01-10 07:51:18,647 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 07:51:18,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 20361 backedges. 23 proven. 2114 refuted. 0 times theorem prover too weak. 18224 trivial. 0 not checked. [2025-01-10 07:51:20,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:20,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249110341] [2025-01-10 07:51:20,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249110341] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:20,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021142785] [2025-01-10 07:51:20,244 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:51:20,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:20,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:20,246 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:20,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 07:51:20,464 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 666 statements into 13 equivalence classes. [2025-01-10 07:51:26,005 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 334 of 666 statements. [2025-01-10 07:51:26,005 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 07:51:26,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:26,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 1824 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-01-10 07:51:26,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:26,036 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-01-10 07:51:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 20361 backedges. 2064 proven. 24 refuted. 0 times theorem prover too weak. 18273 trivial. 0 not checked. [2025-01-10 07:51:26,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 20361 backedges. 16 proven. 2135 refuted. 0 times theorem prover too weak. 18210 trivial. 0 not checked. [2025-01-10 07:51:29,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021142785] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:29,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:29,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 22] total 38 [2025-01-10 07:51:29,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875895818] [2025-01-10 07:51:29,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:29,157 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:29,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:29,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-10 07:51:29,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1123, Unknown=0, NotChecked=0, Total=1406 [2025-01-10 07:51:29,158 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. cyclomatic complexity: 13 Second operand has 38 states, 29 states have (on average 2.586206896551724) internal successors, (75), 32 states have internal predecessors, (75), 11 states have call successors, (28), 8 states have call predecessors, (28), 13 states have return successors, (35), 11 states have call predecessors, (35), 11 states have call successors, (35) [2025-01-10 07:51:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:29,496 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2025-01-10 07:51:29,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 70 transitions. [2025-01-10 07:51:29,497 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:29,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 70 transitions. [2025-01-10 07:51:29,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-01-10 07:51:29,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-01-10 07:51:29,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2025-01-10 07:51:29,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:29,498 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-01-10 07:51:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2025-01-10 07:51:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-10 07:51:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 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), 18 states have return successors, (22), 18 states have call predecessors, (22), 8 states have call successors, (22) [2025-01-10 07:51:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2025-01-10 07:51:29,505 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-01-10 07:51:29,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:51:29,506 INFO L432 stractBuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-01-10 07:51:29,506 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 07:51:29,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 70 transitions. [2025-01-10 07:51:29,506 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:29,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:29,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:29,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:29,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [126, 126, 108, 108, 108, 24, 24, 18, 18, 18, 18, 18, 18, 18, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:51:29,511 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:51:29,512 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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:51:29,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:29,514 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 10 times [2025-01-10 07:51:29,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:29,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283581487] [2025-01-10 07:51:29,514 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:51:29,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:29,519 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-01-10 07:51:29,525 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:29,525 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:51:29,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:29,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:29,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:29,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:29,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:29,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:29,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:29,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:29,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1954708074, now seen corresponding path program 6 times [2025-01-10 07:51:29,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:29,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695310451] [2025-01-10 07:51:29,534 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:51:29,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:29,593 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 846 statements into 15 equivalence classes. [2025-01-10 07:51:29,643 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 156 of 846 statements. [2025-01-10 07:51:29,643 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-10 07:51:29,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 39063 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 39040 trivial. 0 not checked. [2025-01-10 07:51:30,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:30,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695310451] [2025-01-10 07:51:30,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695310451] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:30,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072912484] [2025-01-10 07:51:30,351 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:51:30,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:30,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:30,354 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:30,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 07:51:30,625 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 846 statements into 15 equivalence classes. [2025-01-10 07:51:31,272 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 156 of 846 statements. [2025-01-10 07:51:31,273 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-10 07:51:31,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:31,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-10 07:51:31,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:31,301 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-01-10 07:51:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 39063 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 39048 trivial. 0 not checked. [2025-01-10 07:51:31,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 39063 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 39030 trivial. 0 not checked. [2025-01-10 07:51:34,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072912484] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:34,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:34,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 18] total 33 [2025-01-10 07:51:34,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23987452] [2025-01-10 07:51:34,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:34,026 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:34,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:34,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-10 07:51:34,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 07:51:34,027 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. cyclomatic complexity: 13 Second operand has 33 states, 25 states have (on average 1.96) internal successors, (49), 28 states have internal predecessors, (49), 15 states have call successors, (19), 7 states have call predecessors, (19), 10 states have return successors, (22), 14 states have call predecessors, (22), 14 states have call successors, (22) [2025-01-10 07:51:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:34,358 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2025-01-10 07:51:34,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2025-01-10 07:51:34,359 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:34,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 74 transitions. [2025-01-10 07:51:34,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2025-01-10 07:51:34,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2025-01-10 07:51:34,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 74 transitions. [2025-01-10 07:51:34,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:34,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-01-10 07:51:34,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 74 transitions. [2025-01-10 07:51:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-10 07:51:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 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), 20 states have return successors, (24), 20 states have call predecessors, (24), 8 states have call successors, (24) [2025-01-10 07:51:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2025-01-10 07:51:34,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-01-10 07:51:34,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:51:34,367 INFO L432 stractBuchiCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-01-10 07:51:34,367 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-01-10 07:51:34,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 74 transitions. [2025-01-10 07:51:34,367 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:34,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:34,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:34,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:34,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [210, 210, 180, 180, 180, 40, 40, 30, 30, 30, 30, 30, 30, 30, 15, 15, 10, 10, 10, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:51:34,373 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:51:34,373 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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:51:34,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:34,376 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 11 times [2025-01-10 07:51:34,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:34,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338633075] [2025-01-10 07:51:34,376 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:51:34,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:34,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:34,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:34,385 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:51:34,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:34,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:34,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:34,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:34,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:34,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:34,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:34,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:34,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1720919850, now seen corresponding path program 7 times [2025-01-10 07:51:34,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:34,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712201642] [2025-01-10 07:51:34,393 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:51:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:34,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1404 statements into 1 equivalence classes. [2025-01-10 07:51:34,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1404 of 1404 statements. [2025-01-10 07:51:34,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:34,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 108960 backedges. 324 proven. 621 refuted. 0 times theorem prover too weak. 108015 trivial. 0 not checked. [2025-01-10 07:51:41,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:41,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712201642] [2025-01-10 07:51:41,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712201642] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:41,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544279543] [2025-01-10 07:51:41,526 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:51:41,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:41,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:41,528 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:41,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 07:51:41,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1404 statements into 1 equivalence classes. [2025-01-10 07:51:42,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1404 of 1404 statements. [2025-01-10 07:51:42,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:42,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:42,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 8264 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-01-10 07:51:42,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:42,847 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-01-10 07:51:42,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-10 07:51:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 108960 backedges. 46620 proven. 15 refuted. 0 times theorem prover too weak. 62325 trivial. 0 not checked. [2025-01-10 07:51:43,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 108960 backedges. 608 proven. 323 refuted. 0 times theorem prover too weak. 108029 trivial. 0 not checked. [2025-01-10 07:51:47,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544279543] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:47,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:47,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 18] total 33 [2025-01-10 07:51:47,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015389825] [2025-01-10 07:51:47,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:47,923 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:47,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:47,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-10 07:51:47,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 07:51:47,924 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. cyclomatic complexity: 13 Second operand has 33 states, 24 states have (on average 3.125) internal successors, (75), 28 states have internal predecessors, (75), 16 states have call successors, (32), 7 states have call predecessors, (32), 11 states have return successors, (37), 14 states have call predecessors, (37), 16 states have call successors, (37) [2025-01-10 07:51:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:48,247 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2025-01-10 07:51:48,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 78 transitions. [2025-01-10 07:51:48,249 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:48,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 78 transitions. [2025-01-10 07:51:48,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2025-01-10 07:51:48,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-01-10 07:51:48,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 78 transitions. [2025-01-10 07:51:48,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:48,250 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 78 transitions. [2025-01-10 07:51:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 78 transitions. [2025-01-10 07:51:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-10 07:51:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 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), 22 states have return successors, (26), 22 states have call predecessors, (26), 8 states have call successors, (26) [2025-01-10 07:51:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2025-01-10 07:51:48,254 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 78 transitions. [2025-01-10 07:51:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:51:48,254 INFO L432 stractBuchiCegarLoop]: Abstraction has 70 states and 78 transitions. [2025-01-10 07:51:48,254 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-01-10 07:51:48,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 78 transitions. [2025-01-10 07:51:48,255 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:48,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:48,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:48,259 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:51:48,260 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [350, 350, 300, 300, 300, 60, 60, 50, 50, 50, 50, 50, 50, 50, 15, 15, 10, 10, 10, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:51:48,260 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:51:48,260 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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:51:48,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:48,263 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 12 times [2025-01-10 07:51:48,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:48,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435242205] [2025-01-10 07:51:48,263 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:51:48,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:48,269 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:48,274 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:48,274 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:51:48,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:48,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:48,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:51:48,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:51:48,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:48,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:48,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:48,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:48,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1944021246, now seen corresponding path program 8 times [2025-01-10 07:51:48,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:48,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901817029] [2025-01-10 07:51:48,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:51:48,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:48,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2224 statements into 2 equivalence classes. [2025-01-10 07:51:48,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2224 of 2224 statements. [2025-01-10 07:51:48,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:51:48,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:52:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 300550 backedges. 488 proven. 1613 refuted. 0 times theorem prover too weak. 298449 trivial. 0 not checked. [2025-01-10 07:52:11,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:52:11,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901817029] [2025-01-10 07:52:11,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901817029] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:52:11,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817848628] [2025-01-10 07:52:11,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:52:11,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:52:11,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:52:11,038 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:52:11,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 07:52:11,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2224 statements into 2 equivalence classes. [2025-01-10 07:52:12,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2224 of 2224 statements. [2025-01-10 07:52:12,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:52:12,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:52:12,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 12784 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-01-10 07:52:13,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:52:13,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 07:52:13,371 INFO L134 CoverageAnalysis]: Checked inductivity of 300550 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 300515 trivial. 0 not checked. [2025-01-10 07:52:13,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:52:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 300550 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 300460 trivial. 0 not checked. [2025-01-10 07:52:20,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817848628] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:52:20,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:52:20,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 26] total 50 [2025-01-10 07:52:20,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229453690] [2025-01-10 07:52:20,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:52:20,479 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:52:20,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:52:20,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-10 07:52:20,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=2123, Unknown=0, NotChecked=0, Total=2450 [2025-01-10 07:52:20,480 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. cyclomatic complexity: 13 Second operand has 50 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 42 states have internal predecessors, (77), 21 states have call successors, (30), 10 states have call predecessors, (30), 20 states have return successors, (38), 25 states have call predecessors, (38), 21 states have call successors, (38) [2025-01-10 07:52:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:52:21,175 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2025-01-10 07:52:21,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2025-01-10 07:52:21,175 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:52:21,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 82 transitions. [2025-01-10 07:52:21,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-01-10 07:52:21,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2025-01-10 07:52:21,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 82 transitions. [2025-01-10 07:52:21,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:52:21,177 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 82 transitions. [2025-01-10 07:52:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 82 transitions. [2025-01-10 07:52:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-10 07:52:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 24 states have return successors, (28), 24 states have call predecessors, (28), 8 states have call successors, (28) [2025-01-10 07:52:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2025-01-10 07:52:21,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 82 transitions. [2025-01-10 07:52:21,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 07:52:21,185 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 82 transitions. [2025-01-10 07:52:21,186 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-01-10 07:52:21,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 82 transitions. [2025-01-10 07:52:21,187 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:52:21,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:52:21,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:52:21,195 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:52:21,195 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [504, 504, 432, 432, 432, 84, 84, 72, 72, 72, 72, 72, 72, 72, 18, 18, 12, 12, 12, 12, 12, 12, 12, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:52:21,196 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#1(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#3(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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(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-01-10 07:52:21,196 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#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(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#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(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#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(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-01-10 07:52:21,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:52:21,199 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 13 times [2025-01-10 07:52:21,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:52:21,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71540747] [2025-01-10 07:52:21,199 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:52:21,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:52:21,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:52:21,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:52:21,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:52:21,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:52:21,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:52:21,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:52:21,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:52:21,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:52:21,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:52:21,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:52:21,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:52:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1724001353, now seen corresponding path program 9 times [2025-01-10 07:52:21,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:52:21,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777343922] [2025-01-10 07:52:21,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:52:21,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:52:21,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3159 statements into 170 equivalence classes. [2025-01-10 07:52:21,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 86 of 3159 statements. [2025-01-10 07:52:21,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:52:21,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:52:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 622671 backedges. 271 proven. 8 refuted. 0 times theorem prover too weak. 622392 trivial. 0 not checked. [2025-01-10 07:52:21,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:52:21,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777343922] [2025-01-10 07:52:21,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777343922] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:52:21,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351719955] [2025-01-10 07:52:21,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:52:21,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:52:21,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:52:21,873 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:52:21,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 07:52:22,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3159 statements into 170 equivalence classes. [2025-01-10 07:52:22,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 86 of 3159 statements. [2025-01-10 07:52:22,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:52:22,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:52:22,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-10 07:52:22,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:52:22,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 07:52:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 622671 backedges. 287 proven. 8 refuted. 0 times theorem prover too weak. 622376 trivial. 0 not checked. [2025-01-10 07:52:22,961 INFO L312 TraceCheckSpWp]: Computing backward predicates...