./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 15:02:03,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 15:02:03,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 15:02:03,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 15:02:03,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 15:02:03,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 15:02:03,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 15:02:03,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 15:02:03,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 15:02:03,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 15:02:03,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 15:02:03,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 15:02:03,306 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 15:02:03,307 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 15:02:03,308 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 15:02:03,308 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 15:02:03,308 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 15:02:03,308 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 15:02:03,309 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 15:02:03,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 15:02:03,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 15:02:03,310 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 15:02:03,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 15:02:03,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 15:02:03,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 15:02:03,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 15:02:03,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 15:02:03,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 15:02:03,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 15:02:03,312 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 15:02:03,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 15:02:03,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 15:02:03,313 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 15:02:03,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 15:02:03,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 15:02:03,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 15:02:03,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 15:02:03,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 15:02:03,315 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 15:02:03,315 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2024-11-19 15:02:03,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 15:02:03,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 15:02:03,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 15:02:03,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 15:02:03,552 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 15:02:03,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-19 15:02:05,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 15:02:05,254 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 15:02:05,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-19 15:02:05,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/136103a6a/f7593e9d2ab9438a8d0266bef2fef6c4/FLAGd1e347c71 [2024-11-19 15:02:05,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/136103a6a/f7593e9d2ab9438a8d0266bef2fef6c4 [2024-11-19 15:02:05,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 15:02:05,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 15:02:05,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 15:02:05,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 15:02:05,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 15:02:05,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec9d6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05, skipping insertion in model container [2024-11-19 15:02:05,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 15:02:05,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 15:02:05,506 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 15:02:05,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 15:02:05,536 INFO L204 MainTranslator]: Completed translation [2024-11-19 15:02:05,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05 WrapperNode [2024-11-19 15:02:05,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 15:02:05,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 15:02:05,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 15:02:05,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 15:02:05,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,568 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-19 15:02:05,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 15:02:05,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 15:02:05,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 15:02:05,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 15:02:05,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,604 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]. [2024-11-19 15:02:05,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 15:02:05,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 15:02:05,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 15:02:05,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 15:02:05,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (1/1) ... [2024-11-19 15:02:05,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:05,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:05,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:02:05,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 15:02:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 15:02:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 15:02:05,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 15:02:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 15:02:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 15:02:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 15:02:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 15:02:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 15:02:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 15:02:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 15:02:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 15:02:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 15:02:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 15:02:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 15:02:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-19 15:02:05,698 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-19 15:02:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-19 15:02:05,699 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-19 15:02:05,699 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-19 15:02:05,699 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-19 15:02:05,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 15:02:05,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 15:02:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 15:02:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 15:02:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 15:02:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 15:02:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 15:02:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 15:02:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-11-19 15:02:05,700 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-11-19 15:02:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-19 15:02:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-19 15:02:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 15:02:05,800 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 15:02:05,804 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 15:02:06,011 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-19 15:02:06,012 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 15:02:06,024 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 15:02:06,026 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 15:02:06,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:02:06 BoogieIcfgContainer [2024-11-19 15:02:06,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 15:02:06,027 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 15:02:06,028 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 15:02:06,031 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 15:02:06,031 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:02:06,031 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 03:02:05" (1/3) ... [2024-11-19 15:02:06,032 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c5812ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 03:02:06, skipping insertion in model container [2024-11-19 15:02:06,032 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:02:06,032 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:05" (2/3) ... [2024-11-19 15:02:06,032 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c5812ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 03:02:06, skipping insertion in model container [2024-11-19 15:02:06,033 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:02:06,033 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:02:06" (3/3) ... [2024-11-19 15:02:06,034 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2024-11-19 15:02:06,078 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 15:02:06,078 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 15:02:06,078 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 15:02:06,078 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 15:02:06,078 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 15:02:06,079 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 15:02:06,079 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 15:02:06,079 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 15:02:06,081 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) [2024-11-19 15:02:06,096 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:06,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:06,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:06,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:06,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:06,101 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 15:02:06,102 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) [2024-11-19 15:02:06,108 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:06,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:06,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:06,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:06,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:06,115 INFO L745 eck$LassoCheckResult]: Stem: 19#$Ultimate##0true 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); 26#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 39#L128true 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);< 29#$Ultimate##0true [2024-11-19 15:02:06,115 INFO L747 eck$LassoCheckResult]: Loop: 29#$Ultimate##0true ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 5#L101true assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 6#L107true 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);< 42#$Ultimate##0true ~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#4(~b.base, ~b.offset, 4); 25#L81true assume !(#t~mem13 < 6);havoc #t~mem13; 21#L81-1true assume true; 20#func_to_recursive_line_24_to_25_0EXITtrue >#112#return; 3#L107-1true call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 34#L112true 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);< 29#$Ultimate##0true [2024-11-19 15:02:06,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:06,120 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 1 times [2024-11-19 15:02:06,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:06,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185577010] [2024-11-19 15:02:06,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:06,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:06,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:06,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:06,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:06,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2053320187, now seen corresponding path program 1 times [2024-11-19 15:02:06,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:06,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851776929] [2024-11-19 15:02:06,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:06,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:02:06,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:06,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851776929] [2024-11-19 15:02:06,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851776929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:02:06,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:02:06,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 15:02:06,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397279595] [2024-11-19 15:02:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:02:06,705 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:06,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:06,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 15:02:06,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 15:02:06,729 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) [2024-11-19 15:02:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:06,893 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-19 15:02:06,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2024-11-19 15:02:06,897 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:06,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 44 transitions. [2024-11-19 15:02:06,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-19 15:02:06,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-19 15:02:06,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2024-11-19 15:02:06,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:06,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-19 15:02:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2024-11-19 15:02:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-19 15:02:06,924 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) [2024-11-19 15:02:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-19 15:02:06,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-19 15:02:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 15:02:06,929 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-19 15:02:06,930 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 15:02:06,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2024-11-19 15:02:06,931 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:06,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:06,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:06,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:06,931 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:06,932 INFO L745 eck$LassoCheckResult]: Stem: 151#$Ultimate##0 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); 133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 122#L128 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);< 146#$Ultimate##0 [2024-11-19 15:02:06,932 INFO L747 eck$LassoCheckResult]: Loop: 146#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 131#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 127#L107 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);< 132#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 126#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 129#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 147#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 148#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 136#L61-1 assume true; 134#func_to_recursive_line_25_to_26_0EXIT >#98#return; 137#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 128#L92 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);< 132#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 126#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 130#L81-1 assume true; 149#func_to_recursive_line_24_to_25_0EXIT >#100#return; 150#L81-1 assume true; 152#func_to_recursive_line_24_to_25_0EXIT >#112#return; 121#L107-1 call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 123#L112 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);< 146#$Ultimate##0 [2024-11-19 15:02:06,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 2 times [2024-11-19 15:02:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:06,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475733628] [2024-11-19 15:02:06,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:06,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:06,947 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:02:06,947 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:06,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:06,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:06,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash 54735792, now seen corresponding path program 1 times [2024-11-19 15:02:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:06,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276377557] [2024-11-19 15:02:06,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 15:02:07,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:07,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276377557] [2024-11-19 15:02:07,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276377557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:02:07,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:02:07,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 15:02:07,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440750259] [2024-11-19 15:02:07,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:02:07,137 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:07,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:07,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 15:02:07,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 15:02:07,138 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) [2024-11-19 15:02:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:07,265 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-19 15:02:07,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2024-11-19 15:02:07,266 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:07,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 46 transitions. [2024-11-19 15:02:07,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-11-19 15:02:07,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-19 15:02:07,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2024-11-19 15:02:07,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:07,268 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-19 15:02:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2024-11-19 15:02:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 15:02:07,272 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) [2024-11-19 15:02:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-19 15:02:07,273 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-19 15:02:07,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 15:02:07,274 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-19 15:02:07,274 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 15:02:07,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2024-11-19 15:02:07,278 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:07,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:07,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:07,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:07,279 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] [2024-11-19 15:02:07,279 INFO L745 eck$LassoCheckResult]: Stem: 237#$Ultimate##0 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); 218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 203#L128 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);< 230#$Ultimate##0 [2024-11-19 15:02:07,280 INFO L747 eck$LassoCheckResult]: Loop: 230#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 216#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 213#L107 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);< 217#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 211#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 214#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 231#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 234#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 225#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 226#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 228#L41-1 assume true; 227#func_to_recursive_line_26_to_27_0EXIT >#102#return; 229#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 220#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 231#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 234#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 233#L61-1 assume true; 219#func_to_recursive_line_25_to_26_0EXIT >#104#return; 221#L61-1 assume true; 239#func_to_recursive_line_25_to_26_0EXIT >#98#return; 232#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 212#L92 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);< 217#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 211#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 215#L81-1 assume true; 235#func_to_recursive_line_24_to_25_0EXIT >#100#return; 236#L81-1 assume true; 238#func_to_recursive_line_24_to_25_0EXIT >#112#return; 202#L107-1 call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 204#L112 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);< 230#$Ultimate##0 [2024-11-19 15:02:07,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 3 times [2024-11-19 15:02:07,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:07,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60330528] [2024-11-19 15:02:07,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:02:07,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:07,293 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 15:02:07,294 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:07,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:07,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:07,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1525796123, now seen corresponding path program 1 times [2024-11-19 15:02:07,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:07,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085332897] [2024-11-19 15:02:07,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:07,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 15:02:07,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:07,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085332897] [2024-11-19 15:02:07,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085332897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:02:07,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:02:07,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 15:02:07,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874175244] [2024-11-19 15:02:07,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:02:07,625 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:07,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:07,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 15:02:07,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 15:02:07,626 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) [2024-11-19 15:02:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:07,729 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-19 15:02:07,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2024-11-19 15:02:07,731 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:07,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 48 transitions. [2024-11-19 15:02:07,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-19 15:02:07,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-11-19 15:02:07,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2024-11-19 15:02:07,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:07,733 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-19 15:02:07,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2024-11-19 15:02:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 15:02:07,735 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) [2024-11-19 15:02:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-19 15:02:07,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-19 15:02:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 15:02:07,737 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-19 15:02:07,737 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 15:02:07,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2024-11-19 15:02:07,738 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:07,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:07,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:07,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:07,739 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] [2024-11-19 15:02:07,740 INFO L745 eck$LassoCheckResult]: Stem: 327#$Ultimate##0 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); 307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 297#L128 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);< 319#$Ultimate##0 [2024-11-19 15:02:07,740 INFO L747 eck$LassoCheckResult]: Loop: 319#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 305#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 301#L107 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);< 306#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 300#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 303#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 320#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 324#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 314#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 312#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 315#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 292#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 298#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 299#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 291#L25-1 assume true; 294#func_to_recursive_line_27_to_27_0EXIT >#108#return; 311#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 313#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 312#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 315#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 318#L41-1 assume true; 316#func_to_recursive_line_26_to_27_0EXIT >#110#return; 317#L41-1 assume true; 330#func_to_recursive_line_26_to_27_0EXIT >#102#return; 322#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 309#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 320#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 324#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 323#L61-1 assume true; 308#func_to_recursive_line_25_to_26_0EXIT >#104#return; 310#L61-1 assume true; 329#func_to_recursive_line_25_to_26_0EXIT >#98#return; 321#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 302#L92 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);< 306#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 300#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 304#L81-1 assume true; 325#func_to_recursive_line_24_to_25_0EXIT >#100#return; 326#L81-1 assume true; 328#func_to_recursive_line_24_to_25_0EXIT >#112#return; 295#L107-1 call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 296#L112 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);< 319#$Ultimate##0 [2024-11-19 15:02:07,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:07,741 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 4 times [2024-11-19 15:02:07,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:07,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231855879] [2024-11-19 15:02:07,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 15:02:07,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:07,755 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 15:02:07,756 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:07,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:07,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:07,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:07,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1439872263, now seen corresponding path program 1 times [2024-11-19 15:02:07,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:07,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738840659] [2024-11-19 15:02:07,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:07,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 15:02:08,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:08,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738840659] [2024-11-19 15:02:08,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738840659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:02:08,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:02:08,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 15:02:08,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257799472] [2024-11-19 15:02:08,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:02:08,019 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:08,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:08,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 15:02:08,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 15:02:08,020 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) [2024-11-19 15:02:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:08,090 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-19 15:02:08,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2024-11-19 15:02:08,091 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:08,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2024-11-19 15:02:08,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-19 15:02:08,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-19 15:02:08,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2024-11-19 15:02:08,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:08,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-19 15:02:08,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2024-11-19 15:02:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-19 15:02:08,100 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) [2024-11-19 15:02:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-11-19 15:02:08,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-19 15:02:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 15:02:08,104 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-19 15:02:08,104 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 15:02:08,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2024-11-19 15:02:08,104 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:08,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:08,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:08,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:08,105 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] [2024-11-19 15:02:08,105 INFO L745 eck$LassoCheckResult]: Stem: 419#$Ultimate##0 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); 400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 389#L128 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);< 411#$Ultimate##0 [2024-11-19 15:02:08,105 INFO L747 eck$LassoCheckResult]: Loop: 411#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 398#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 394#L107 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);< 399#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 393#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 396#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 417#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 406#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 405#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 408#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 386#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 391#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 392#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 385#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 391#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 392#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 384#L25-1 assume true; 387#func_to_recursive_line_27_to_27_0EXIT >#106#return; 404#L25-1 assume true; 424#func_to_recursive_line_27_to_27_0EXIT >#108#return; 422#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 407#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 405#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 408#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 412#L41-1 assume true; 409#func_to_recursive_line_26_to_27_0EXIT >#110#return; 410#L41-1 assume true; 425#func_to_recursive_line_26_to_27_0EXIT >#102#return; 415#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 402#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 417#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 418#L61-1 assume true; 401#func_to_recursive_line_25_to_26_0EXIT >#104#return; 403#L61-1 assume true; 416#func_to_recursive_line_25_to_26_0EXIT >#98#return; 414#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 395#L92 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);< 399#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 393#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 397#L81-1 assume true; 420#func_to_recursive_line_24_to_25_0EXIT >#100#return; 421#L81-1 assume true; 423#func_to_recursive_line_24_to_25_0EXIT >#112#return; 388#L107-1 call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 390#L112 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);< 411#$Ultimate##0 [2024-11-19 15:02:08,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:08,108 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 5 times [2024-11-19 15:02:08,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:08,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235150527] [2024-11-19 15:02:08,108 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 15:02:08,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:08,119 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:02:08,120 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:08,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:08,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:08,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash 405682375, now seen corresponding path program 1 times [2024-11-19 15:02:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:08,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168031223] [2024-11-19 15:02:08,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:08,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 15:02:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:08,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168031223] [2024-11-19 15:02:08,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168031223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:08,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011869991] [2024-11-19 15:02:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:08,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:08,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:08,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 15:02:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:08,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 15:02:08,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:08,633 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 [2024-11-19 15:02:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 15:02:08,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 15:02:09,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011869991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:09,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:09,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2024-11-19 15:02:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885060163] [2024-11-19 15:02:09,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:09,265 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:09,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 15:02:09,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2024-11-19 15:02:09,269 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand has 24 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 20 states have internal predecessors, (51), 10 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-19 15:02:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:09,727 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-19 15:02:09,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-11-19 15:02:09,728 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:09,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2024-11-19 15:02:09,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-11-19 15:02:09,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-19 15:02:09,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2024-11-19 15:02:09,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:09,732 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-19 15:02:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2024-11-19 15:02:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-19 15:02:09,738 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) [2024-11-19 15:02:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-19 15:02:09,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-19 15:02:09,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 15:02:09,743 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-19 15:02:09,743 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 15:02:09,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-11-19 15:02:09,743 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:09,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:09,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:09,749 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:09,749 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:09,750 INFO L745 eck$LassoCheckResult]: Stem: 833#$Ultimate##0 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); 815#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 805#L128 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);< 826#$Ultimate##0 [2024-11-19 15:02:09,750 INFO L747 eck$LassoCheckResult]: Loop: 826#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 813#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 809#L107 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);< 814#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 808#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 811#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 828#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 832#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 821#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 820#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 823#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 800#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 806#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 807#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 801#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 806#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 807#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 801#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 806#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 807#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 799#L25-1 assume true; 802#func_to_recursive_line_27_to_27_0EXIT >#106#return; 816#L25-1 assume true; 842#func_to_recursive_line_27_to_27_0EXIT >#106#return; 841#L25-1 assume true; 840#func_to_recursive_line_27_to_27_0EXIT >#108#return; 836#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 822#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 820#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 823#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 827#L41-1 assume true; 824#func_to_recursive_line_26_to_27_0EXIT >#110#return; 825#L41-1 assume true; 844#func_to_recursive_line_26_to_27_0EXIT >#102#return; 830#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 818#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 828#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 832#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 821#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 820#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 823#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 800#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 806#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 807#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 801#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 806#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 807#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 801#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 806#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 807#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 799#L25-1 assume true; 802#func_to_recursive_line_27_to_27_0EXIT >#106#return; 816#L25-1 assume true; 842#func_to_recursive_line_27_to_27_0EXIT >#106#return; 841#L25-1 assume true; 840#func_to_recursive_line_27_to_27_0EXIT >#108#return; 836#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 822#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 820#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 823#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 827#L41-1 assume true; 824#func_to_recursive_line_26_to_27_0EXIT >#110#return; 825#L41-1 assume true; 844#func_to_recursive_line_26_to_27_0EXIT >#102#return; 830#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 818#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 828#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 832#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 831#L61-1 assume true; 817#func_to_recursive_line_25_to_26_0EXIT >#104#return; 819#L61-1 assume true; 843#func_to_recursive_line_25_to_26_0EXIT >#104#return; 839#L61-1 assume true; 838#func_to_recursive_line_25_to_26_0EXIT >#98#return; 829#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 810#L92 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);< 814#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 808#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 812#L81-1 assume true; 834#func_to_recursive_line_24_to_25_0EXIT >#100#return; 835#L81-1 assume true; 837#func_to_recursive_line_24_to_25_0EXIT >#112#return; 803#L107-1 call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 804#L112 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);< 826#$Ultimate##0 [2024-11-19 15:02:09,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:09,751 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 6 times [2024-11-19 15:02:09,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:09,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260934081] [2024-11-19 15:02:09,751 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 15:02:09,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:09,774 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 15:02:09,776 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:09,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:09,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:09,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1884622642, now seen corresponding path program 2 times [2024-11-19 15:02:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:09,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586372877] [2024-11-19 15:02:09,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:09,840 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 15:02:09,841 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 10 proven. 57 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-19 15:02:10,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586372877] [2024-11-19 15:02:10,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586372877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:10,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338575512] [2024-11-19 15:02:10,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:10,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:10,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:10,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:10,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 15:02:10,630 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 15:02:10,630 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:10,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 15:02:10,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:10,654 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 [2024-11-19 15:02:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-19 15:02:10,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-19 15:02:11,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338575512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:11,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:11,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 33 [2024-11-19 15:02:11,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912746999] [2024-11-19 15:02:11,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:11,615 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:11,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:11,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 15:02:11,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 15:02:11,617 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 33 states, 25 states have (on average 2.44) internal successors, (61), 28 states have internal predecessors, (61), 13 states have call successors, (23), 7 states have call predecessors, (23), 11 states have return successors, (24), 11 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-19 15:02:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:12,128 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-19 15:02:12,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2024-11-19 15:02:12,129 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:12,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2024-11-19 15:02:12,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-19 15:02:12,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-19 15:02:12,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2024-11-19 15:02:12,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:12,131 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-19 15:02:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2024-11-19 15:02:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-19 15:02:12,134 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) [2024-11-19 15:02:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-19 15:02:12,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-19 15:02:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 15:02:12,138 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-19 15:02:12,138 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 15:02:12,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2024-11-19 15:02:12,139 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:12,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:12,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:12,140 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:12,143 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:12,143 INFO L745 eck$LassoCheckResult]: Stem: 1493#$Ultimate##0 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); 1472#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1461#L128 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);< 1484#$Ultimate##0 [2024-11-19 15:02:12,144 INFO L747 eck$LassoCheckResult]: Loop: 1484#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 1470#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 1466#L107 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);< 1471#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 1465#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 1468#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1485#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 1489#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 1479#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1477#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 1480#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1457#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1463#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1464#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1458#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1463#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1464#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1458#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1463#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1464#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1458#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1463#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1464#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1456#L25-1 assume true; 1459#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1473#L25-1 assume true; 1503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1502#L25-1 assume true; 1501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1500#L25-1 assume true; 1499#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1495#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1478#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1477#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 1480#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1483#L41-1 assume true; 1481#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1482#L41-1 assume true; 1494#func_to_recursive_line_26_to_27_0EXIT >#102#return; 1487#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1475#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1485#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 1489#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 1479#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1477#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 1480#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1457#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1463#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1464#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1458#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1463#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1464#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1458#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1463#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1464#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1458#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1463#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1464#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1456#L25-1 assume true; 1459#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1473#L25-1 assume true; 1503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1502#L25-1 assume true; 1501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1500#L25-1 assume true; 1499#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1495#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1478#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1477#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 1480#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1483#L41-1 assume true; 1481#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1482#L41-1 assume true; 1494#func_to_recursive_line_26_to_27_0EXIT >#102#return; 1487#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1475#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1485#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 1489#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 1479#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1477#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 1480#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 1457#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1463#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1464#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1458#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1463#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1464#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1458#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1463#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1464#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1458#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1463#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 1464#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1456#L25-1 assume true; 1459#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1473#L25-1 assume true; 1503#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1502#L25-1 assume true; 1501#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1500#L25-1 assume true; 1499#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1495#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1478#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1477#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 1480#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1483#L41-1 assume true; 1481#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1482#L41-1 assume true; 1494#func_to_recursive_line_26_to_27_0EXIT >#102#return; 1487#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1475#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1485#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 1489#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1490#L61-1 assume true; 1474#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1476#L61-1 assume true; 1488#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1505#L61-1 assume true; 1504#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1498#L61-1 assume true; 1497#func_to_recursive_line_25_to_26_0EXIT >#98#return; 1486#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1467#L92 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);< 1471#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 1465#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1469#L81-1 assume true; 1491#func_to_recursive_line_24_to_25_0EXIT >#100#return; 1492#L81-1 assume true; 1496#func_to_recursive_line_24_to_25_0EXIT >#112#return; 1460#L107-1 call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1462#L112 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);< 1484#$Ultimate##0 [2024-11-19 15:02:12,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:12,144 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 7 times [2024-11-19 15:02:12,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:12,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584343860] [2024-11-19 15:02:12,144 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 15:02:12,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:12,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:12,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:12,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:12,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2091880571, now seen corresponding path program 3 times [2024-11-19 15:02:12,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:12,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194867824] [2024-11-19 15:02:12,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:02:12,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:12,218 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 15:02:12,222 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2024-11-19 15:02:12,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:12,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194867824] [2024-11-19 15:02:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194867824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:12,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782948394] [2024-11-19 15:02:12,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:02:12,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:12,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:12,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:12,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 15:02:12,671 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 15:02:12,671 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:12,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 15:02:12,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:12,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 15:02:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2024-11-19 15:02:12,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-19 15:02:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782948394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:13,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:13,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 20 [2024-11-19 15:02:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214125743] [2024-11-19 15:02:13,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:13,159 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:13,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 15:02:13,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-11-19 15:02:13,160 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 20 states, 15 states have (on average 2.466666666666667) internal successors, (37), 17 states have internal predecessors, (37), 9 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 6 states have call predecessors, (13), 8 states have call successors, (13) [2024-11-19 15:02:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:13,402 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-11-19 15:02:13,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2024-11-19 15:02:13,404 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:13,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2024-11-19 15:02:13,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-11-19 15:02:13,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2024-11-19 15:02:13,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2024-11-19 15:02:13,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:13,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-19 15:02:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2024-11-19 15:02:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-19 15:02:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 33 states have internal predecessors, (33), 10 states have call successors, (10), 5 states have call predecessors, (10), 13 states have return successors, (17), 13 states have call predecessors, (17), 8 states have call successors, (17) [2024-11-19 15:02:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-11-19 15:02:13,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-19 15:02:13,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 15:02:13,417 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-19 15:02:13,420 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 15:02:13,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2024-11-19 15:02:13,421 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:13,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:13,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:13,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:13,427 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 18, 18, 18, 12, 12, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:13,427 INFO L745 eck$LassoCheckResult]: Stem: 2401#$Ultimate##0 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); 2383#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 2373#L128 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);< 2394#$Ultimate##0 [2024-11-19 15:02:13,428 INFO L747 eck$LassoCheckResult]: Loop: 2394#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 2381#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 2377#L107 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);< 2382#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 2376#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 2379#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2396#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 2400#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 2389#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2388#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2391#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 2369#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2367#L25-1 assume true; 2370#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2387#L25-1 assume true; 2416#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2415#L25-1 assume true; 2413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2410#L25-1 assume true; 2409#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2404#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2390#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2388#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2391#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2395#L41-1 assume true; 2392#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2393#L41-1 assume true; 2418#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2398#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 2385#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2396#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 2400#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 2389#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2388#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2391#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 2369#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2367#L25-1 assume true; 2370#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2387#L25-1 assume true; 2416#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2415#L25-1 assume true; 2413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2410#L25-1 assume true; 2409#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2404#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2390#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2388#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2391#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2395#L41-1 assume true; 2392#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2393#L41-1 assume true; 2418#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2398#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 2385#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2396#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 2400#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 2389#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2388#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2391#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 2369#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2367#L25-1 assume true; 2370#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2387#L25-1 assume true; 2416#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2415#L25-1 assume true; 2413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2410#L25-1 assume true; 2409#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2404#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2390#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2388#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2391#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2395#L41-1 assume true; 2392#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2393#L41-1 assume true; 2418#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2398#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 2385#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2396#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 2400#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2399#L61-1 assume true; 2384#func_to_recursive_line_25_to_26_0EXIT >#104#return; 2386#L61-1 assume true; 2417#func_to_recursive_line_25_to_26_0EXIT >#104#return; 2414#L61-1 assume true; 2412#func_to_recursive_line_25_to_26_0EXIT >#104#return; 2408#L61-1 assume true; 2407#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2397#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 2378#L92 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);< 2382#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 2376#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 2379#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2396#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 2400#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 2389#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2388#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2391#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 2369#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2367#L25-1 assume true; 2370#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2387#L25-1 assume true; 2416#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2415#L25-1 assume true; 2413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2410#L25-1 assume true; 2409#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2404#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2390#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2388#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2391#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2395#L41-1 assume true; 2392#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2393#L41-1 assume true; 2418#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2398#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 2385#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2396#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 2400#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 2389#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2388#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2391#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 2369#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2367#L25-1 assume true; 2370#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2387#L25-1 assume true; 2416#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2415#L25-1 assume true; 2413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2410#L25-1 assume true; 2409#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2404#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2390#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2388#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2391#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2395#L41-1 assume true; 2392#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2393#L41-1 assume true; 2418#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2398#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 2385#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2396#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 2400#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 2389#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2388#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2391#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 2369#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2368#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2374#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 2375#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2367#L25-1 assume true; 2370#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2387#L25-1 assume true; 2416#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2415#L25-1 assume true; 2413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2410#L25-1 assume true; 2409#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2404#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2390#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2388#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 2391#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2395#L41-1 assume true; 2392#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2393#L41-1 assume true; 2418#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2398#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 2385#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2396#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 2400#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2399#L61-1 assume true; 2384#func_to_recursive_line_25_to_26_0EXIT >#104#return; 2386#L61-1 assume true; 2417#func_to_recursive_line_25_to_26_0EXIT >#104#return; 2414#L61-1 assume true; 2412#func_to_recursive_line_25_to_26_0EXIT >#104#return; 2408#L61-1 assume true; 2407#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2397#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 2378#L92 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);< 2382#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 2376#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2380#L81-1 assume true; 2402#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2403#L81-1 assume true; 2411#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2406#L81-1 assume true; 2405#func_to_recursive_line_24_to_25_0EXIT >#112#return; 2371#L107-1 call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 2372#L112 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);< 2394#$Ultimate##0 [2024-11-19 15:02:13,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:13,428 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 8 times [2024-11-19 15:02:13,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:13,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718246264] [2024-11-19 15:02:13,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:13,445 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:02:13,445 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:13,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:13,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:13,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash -944473457, now seen corresponding path program 4 times [2024-11-19 15:02:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878487407] [2024-11-19 15:02:13,457 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 15:02:13,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:13,519 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 15:02:13,522 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1738 backedges. 34 proven. 109 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2024-11-19 15:02:14,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878487407] [2024-11-19 15:02:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878487407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579280359] [2024-11-19 15:02:14,328 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 15:02:14,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:14,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:14,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:14,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 15:02:14,584 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 15:02:14,585 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:14,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 1706 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-19 15:02:14,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:14,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 15:02:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1738 backedges. 1046 proven. 24 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2024-11-19 15:02:14,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1738 backedges. 176 proven. 299 refuted. 0 times theorem prover too weak. 1263 trivial. 0 not checked. [2024-11-19 15:02:17,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579280359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:17,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:17,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 18] total 37 [2024-11-19 15:02:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204369788] [2024-11-19 15:02:17,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:17,317 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:17,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 15:02:17,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1142, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 15:02:17,318 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 13 Second operand has 37 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 31 states have internal predecessors, (77), 14 states have call successors, (31), 8 states have call predecessors, (31), 12 states have return successors, (35), 10 states have call predecessors, (35), 14 states have call successors, (35) [2024-11-19 15:02:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:17,947 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2024-11-19 15:02:17,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 64 transitions. [2024-11-19 15:02:17,948 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:17,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 64 transitions. [2024-11-19 15:02:17,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-11-19 15:02:17,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-11-19 15:02:17,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2024-11-19 15:02:17,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:17,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-11-19 15:02:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2024-11-19 15:02:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-19 15:02:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 5 states have call predecessors, (10), 15 states have return successors, (19), 15 states have call predecessors, (19), 8 states have call successors, (19) [2024-11-19 15:02:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2024-11-19 15:02:17,954 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-11-19 15:02:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 15:02:17,955 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-11-19 15:02:17,955 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 15:02:17,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2024-11-19 15:02:17,955 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:17,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:17,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:17,979 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:17,979 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [60, 60, 48, 48, 48, 18, 18, 12, 12, 12, 12, 12, 12, 12, 8, 8, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:17,979 INFO L745 eck$LassoCheckResult]: Stem: 4095#$Ultimate##0 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); 4076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 4065#L128 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);< 4087#$Ultimate##0 [2024-11-19 15:02:17,979 INFO L747 eck$LassoCheckResult]: Loop: 4087#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 4074#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 4071#L107 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);< 4075#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 4069#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 4072#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4089#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 4093#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 4083#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 4061#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4060#L25-1 assume true; 4063#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4080#L25-1 assume true; 4112#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4111#L25-1 assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4109#L25-1 assume true; 4107#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4104#L25-1 assume true; 4103#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4098#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4082#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 4061#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4060#L25-1 assume true; 4063#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4080#L25-1 assume true; 4112#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4111#L25-1 assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4109#L25-1 assume true; 4107#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4104#L25-1 assume true; 4103#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4098#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4082#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4088#L41-1 assume true; 4085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4086#L41-1 assume true; 4115#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4114#L41-1 assume true; 4113#func_to_recursive_line_26_to_27_0EXIT >#102#return; 4091#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 4078#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4089#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 4093#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 4083#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 4061#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4060#L25-1 assume true; 4063#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4080#L25-1 assume true; 4112#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4111#L25-1 assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4109#L25-1 assume true; 4107#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4104#L25-1 assume true; 4103#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4098#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4082#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 4061#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4060#L25-1 assume true; 4063#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4080#L25-1 assume true; 4112#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4111#L25-1 assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4109#L25-1 assume true; 4107#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4104#L25-1 assume true; 4103#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4098#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4082#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4088#L41-1 assume true; 4085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4086#L41-1 assume true; 4115#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4114#L41-1 assume true; 4113#func_to_recursive_line_26_to_27_0EXIT >#102#return; 4091#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 4078#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4089#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 4093#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 4083#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 4061#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4060#L25-1 assume true; 4063#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4080#L25-1 assume true; 4112#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4111#L25-1 assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4109#L25-1 assume true; 4107#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4104#L25-1 assume true; 4103#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4098#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4082#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 4061#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4060#L25-1 assume true; 4063#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4080#L25-1 assume true; 4112#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4111#L25-1 assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4109#L25-1 assume true; 4107#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4104#L25-1 assume true; 4103#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4098#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4082#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4088#L41-1 assume true; 4085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4086#L41-1 assume true; 4115#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4114#L41-1 assume true; 4113#func_to_recursive_line_26_to_27_0EXIT >#102#return; 4091#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 4078#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4089#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 4093#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 4094#L61-1 assume true; 4077#func_to_recursive_line_25_to_26_0EXIT >#104#return; 4079#L61-1 assume true; 4092#func_to_recursive_line_25_to_26_0EXIT >#104#return; 4108#L61-1 assume true; 4106#func_to_recursive_line_25_to_26_0EXIT >#104#return; 4102#L61-1 assume true; 4101#func_to_recursive_line_25_to_26_0EXIT >#98#return; 4090#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 4070#L92 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);< 4075#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 4069#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 4072#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4089#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 4093#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 4083#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 4061#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4060#L25-1 assume true; 4063#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4080#L25-1 assume true; 4112#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4111#L25-1 assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4109#L25-1 assume true; 4107#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4104#L25-1 assume true; 4103#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4098#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4082#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 4061#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4060#L25-1 assume true; 4063#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4080#L25-1 assume true; 4112#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4111#L25-1 assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4109#L25-1 assume true; 4107#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4104#L25-1 assume true; 4103#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4098#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4082#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4088#L41-1 assume true; 4085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4086#L41-1 assume true; 4115#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4114#L41-1 assume true; 4113#func_to_recursive_line_26_to_27_0EXIT >#102#return; 4091#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 4078#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4089#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 4093#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 4083#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 4061#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4060#L25-1 assume true; 4063#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4080#L25-1 assume true; 4112#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4111#L25-1 assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4109#L25-1 assume true; 4107#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4104#L25-1 assume true; 4103#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4098#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4082#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 4061#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4060#L25-1 assume true; 4063#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4080#L25-1 assume true; 4112#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4111#L25-1 assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4109#L25-1 assume true; 4107#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4104#L25-1 assume true; 4103#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4098#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4082#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4088#L41-1 assume true; 4085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4086#L41-1 assume true; 4115#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4114#L41-1 assume true; 4113#func_to_recursive_line_26_to_27_0EXIT >#102#return; 4091#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 4078#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4089#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 4093#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 4083#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 4061#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4060#L25-1 assume true; 4063#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4080#L25-1 assume true; 4112#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4111#L25-1 assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4109#L25-1 assume true; 4107#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4104#L25-1 assume true; 4103#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4098#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4082#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 4061#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4067#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 4068#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4060#L25-1 assume true; 4063#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4080#L25-1 assume true; 4112#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4111#L25-1 assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4109#L25-1 assume true; 4107#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4104#L25-1 assume true; 4103#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4098#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4082#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4081#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 4084#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4088#L41-1 assume true; 4085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4086#L41-1 assume true; 4115#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4114#L41-1 assume true; 4113#func_to_recursive_line_26_to_27_0EXIT >#102#return; 4091#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 4078#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4089#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 4093#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 4094#L61-1 assume true; 4077#func_to_recursive_line_25_to_26_0EXIT >#104#return; 4079#L61-1 assume true; 4092#func_to_recursive_line_25_to_26_0EXIT >#104#return; 4108#L61-1 assume true; 4106#func_to_recursive_line_25_to_26_0EXIT >#104#return; 4102#L61-1 assume true; 4101#func_to_recursive_line_25_to_26_0EXIT >#98#return; 4090#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 4070#L92 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);< 4075#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 4069#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 4073#L81-1 assume true; 4096#func_to_recursive_line_24_to_25_0EXIT >#100#return; 4097#L81-1 assume true; 4105#func_to_recursive_line_24_to_25_0EXIT >#100#return; 4100#L81-1 assume true; 4099#func_to_recursive_line_24_to_25_0EXIT >#112#return; 4064#L107-1 call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 4066#L112 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);< 4087#$Ultimate##0 [2024-11-19 15:02:17,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 9 times [2024-11-19 15:02:17,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:17,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284861524] [2024-11-19 15:02:17,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:02:17,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:17,996 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 15:02:17,996 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:17,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:18,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:18,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:18,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1451236699, now seen corresponding path program 5 times [2024-11-19 15:02:18,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:18,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691592035] [2024-11-19 15:02:18,005 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 15:02:18,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:18,107 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-19 15:02:18,111 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9190 backedges. 17 proven. 1383 refuted. 0 times theorem prover too weak. 7790 trivial. 0 not checked. [2024-11-19 15:02:19,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691592035] [2024-11-19 15:02:19,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691592035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846990578] [2024-11-19 15:02:19,344 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 15:02:19,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:19,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:19,350 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:19,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 15:02:20,191 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-19 15:02:20,192 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:20,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-19 15:02:20,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:20,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 15:02:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9190 backedges. 1345 proven. 24 refuted. 0 times theorem prover too weak. 7821 trivial. 0 not checked. [2024-11-19 15:02:20,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9190 backedges. 14 proven. 1405 refuted. 0 times theorem prover too weak. 7771 trivial. 0 not checked. [2024-11-19 15:02:23,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846990578] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:23,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:23,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 22] total 35 [2024-11-19 15:02:23,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542179888] [2024-11-19 15:02:23,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:23,584 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:23,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:23,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 15:02:23,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=926, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 15:02:23,585 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. cyclomatic complexity: 13 Second operand has 35 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 29 states have internal predecessors, (72), 10 states have call successors, (27), 8 states have call predecessors, (27), 12 states have return successors, (35), 10 states have call predecessors, (35), 10 states have call successors, (35) [2024-11-19 15:02:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:23,801 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-11-19 15:02:23,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2024-11-19 15:02:23,802 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:23,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2024-11-19 15:02:23,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-19 15:02:23,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-11-19 15:02:23,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2024-11-19 15:02:23,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:23,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-19 15:02:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2024-11-19 15:02:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-19 15:02:23,811 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) [2024-11-19 15:02:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-11-19 15:02:23,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-19 15:02:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 15:02:23,813 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-19 15:02:23,813 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 15:02:23,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2024-11-19 15:02:23,816 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:23,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:23,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:23,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:23,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [72, 72, 60, 60, 60, 18, 18, 12, 12, 12, 12, 12, 12, 12, 8, 8, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:23,822 INFO L745 eck$LassoCheckResult]: Stem: 7061#$Ultimate##0 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); 7042#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 7031#L128 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);< 7053#$Ultimate##0 [2024-11-19 15:02:23,823 INFO L747 eck$LassoCheckResult]: Loop: 7053#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 7040#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 7036#L107 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);< 7041#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 7035#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 7038#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7055#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 7059#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 7048#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 7027#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7026#L25-1 assume true; 7029#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7046#L25-1 assume true; 7080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7079#L25-1 assume true; 7078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7077#L25-1 assume true; 7076#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7075#L25-1 assume true; 7073#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7070#L25-1 assume true; 7069#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7064#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7049#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 7027#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7026#L25-1 assume true; 7029#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7046#L25-1 assume true; 7080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7079#L25-1 assume true; 7078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7077#L25-1 assume true; 7076#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7075#L25-1 assume true; 7073#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7070#L25-1 assume true; 7069#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7064#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7049#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7054#L41-1 assume true; 7051#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7052#L41-1 assume true; 7083#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7082#L41-1 assume true; 7081#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7057#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 7044#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7055#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 7059#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 7048#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 7027#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7026#L25-1 assume true; 7029#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7046#L25-1 assume true; 7080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7079#L25-1 assume true; 7078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7077#L25-1 assume true; 7076#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7075#L25-1 assume true; 7073#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7070#L25-1 assume true; 7069#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7064#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7049#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 7027#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7026#L25-1 assume true; 7029#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7046#L25-1 assume true; 7080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7079#L25-1 assume true; 7078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7077#L25-1 assume true; 7076#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7075#L25-1 assume true; 7073#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7070#L25-1 assume true; 7069#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7064#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7049#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7054#L41-1 assume true; 7051#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7052#L41-1 assume true; 7083#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7082#L41-1 assume true; 7081#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7057#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 7044#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7055#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 7059#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 7048#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 7027#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7026#L25-1 assume true; 7029#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7046#L25-1 assume true; 7080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7079#L25-1 assume true; 7078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7077#L25-1 assume true; 7076#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7075#L25-1 assume true; 7073#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7070#L25-1 assume true; 7069#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7064#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7049#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 7027#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7026#L25-1 assume true; 7029#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7046#L25-1 assume true; 7080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7079#L25-1 assume true; 7078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7077#L25-1 assume true; 7076#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7075#L25-1 assume true; 7073#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7070#L25-1 assume true; 7069#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7064#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7049#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7054#L41-1 assume true; 7051#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7052#L41-1 assume true; 7083#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7082#L41-1 assume true; 7081#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7057#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 7044#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7055#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 7059#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7060#L61-1 assume true; 7043#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7045#L61-1 assume true; 7058#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7074#L61-1 assume true; 7072#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7068#L61-1 assume true; 7067#func_to_recursive_line_25_to_26_0EXIT >#98#return; 7056#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 7037#L92 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);< 7041#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 7035#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 7038#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7055#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 7059#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 7048#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 7027#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7026#L25-1 assume true; 7029#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7046#L25-1 assume true; 7080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7079#L25-1 assume true; 7078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7077#L25-1 assume true; 7076#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7075#L25-1 assume true; 7073#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7070#L25-1 assume true; 7069#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7064#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7049#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 7027#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7026#L25-1 assume true; 7029#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7046#L25-1 assume true; 7080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7079#L25-1 assume true; 7078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7077#L25-1 assume true; 7076#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7075#L25-1 assume true; 7073#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7070#L25-1 assume true; 7069#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7064#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7049#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7054#L41-1 assume true; 7051#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7052#L41-1 assume true; 7083#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7082#L41-1 assume true; 7081#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7057#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 7044#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7055#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 7059#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 7048#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 7027#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7026#L25-1 assume true; 7029#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7046#L25-1 assume true; 7080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7079#L25-1 assume true; 7078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7077#L25-1 assume true; 7076#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7075#L25-1 assume true; 7073#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7070#L25-1 assume true; 7069#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7064#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7049#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 7027#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7026#L25-1 assume true; 7029#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7046#L25-1 assume true; 7080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7079#L25-1 assume true; 7078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7077#L25-1 assume true; 7076#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7075#L25-1 assume true; 7073#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7070#L25-1 assume true; 7069#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7064#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7049#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7054#L41-1 assume true; 7051#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7052#L41-1 assume true; 7083#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7082#L41-1 assume true; 7081#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7057#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 7044#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7055#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 7059#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 7048#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 7027#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7026#L25-1 assume true; 7029#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7046#L25-1 assume true; 7080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7079#L25-1 assume true; 7078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7077#L25-1 assume true; 7076#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7075#L25-1 assume true; 7073#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7070#L25-1 assume true; 7069#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7064#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7049#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 7027#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7028#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7033#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 7034#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7026#L25-1 assume true; 7029#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7046#L25-1 assume true; 7080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7079#L25-1 assume true; 7078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7077#L25-1 assume true; 7076#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7075#L25-1 assume true; 7073#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7070#L25-1 assume true; 7069#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7064#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 7049#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7047#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 7050#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7054#L41-1 assume true; 7051#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7052#L41-1 assume true; 7083#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7082#L41-1 assume true; 7081#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7057#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 7044#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7055#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 7059#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7060#L61-1 assume true; 7043#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7045#L61-1 assume true; 7058#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7074#L61-1 assume true; 7072#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7068#L61-1 assume true; 7067#func_to_recursive_line_25_to_26_0EXIT >#98#return; 7056#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 7037#L92 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);< 7041#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 7035#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7039#L81-1 assume true; 7062#func_to_recursive_line_24_to_25_0EXIT >#100#return; 7063#L81-1 assume true; 7071#func_to_recursive_line_24_to_25_0EXIT >#100#return; 7066#L81-1 assume true; 7065#func_to_recursive_line_24_to_25_0EXIT >#112#return; 7030#L107-1 call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 7032#L112 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);< 7053#$Ultimate##0 [2024-11-19 15:02:23,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:23,823 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 10 times [2024-11-19 15:02:23,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:23,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792746069] [2024-11-19 15:02:23,824 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 15:02:23,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:23,840 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 15:02:23,840 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:23,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:23,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:23,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:23,856 INFO L85 PathProgramCache]: Analyzing trace with hash 709874551, now seen corresponding path program 6 times [2024-11-19 15:02:23,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:23,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236291144] [2024-11-19 15:02:23,856 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 15:02:23,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:23,950 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-19 15:02:23,950 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12976 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 12964 trivial. 0 not checked. [2024-11-19 15:02:24,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:24,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236291144] [2024-11-19 15:02:24,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236291144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:24,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58407715] [2024-11-19 15:02:24,654 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 15:02:24,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:24,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:24,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:24,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 15:02:24,953 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-19 15:02:24,954 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:24,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 15:02:24,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:24,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 15:02:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12976 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12968 trivial. 0 not checked. [2024-11-19 15:02:25,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12976 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12961 trivial. 0 not checked. [2024-11-19 15:02:27,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58407715] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:27,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:27,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 28 [2024-11-19 15:02:27,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498557868] [2024-11-19 15:02:27,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:27,241 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:27,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:27,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 15:02:27,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2024-11-19 15:02:27,243 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. cyclomatic complexity: 13 Second operand has 28 states, 20 states have (on average 2.25) internal successors, (45), 24 states have internal predecessors, (45), 14 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2024-11-19 15:02:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:27,653 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-19 15:02:27,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 70 transitions. [2024-11-19 15:02:27,654 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:27,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 70 transitions. [2024-11-19 15:02:27,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2024-11-19 15:02:27,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2024-11-19 15:02:27,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2024-11-19 15:02:27,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:27,658 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-19 15:02:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2024-11-19 15:02:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-19 15:02:27,664 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) [2024-11-19 15:02:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-11-19 15:02:27,664 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-19 15:02:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 15:02:27,665 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-19 15:02:27,665 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 15:02:27,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 70 transitions. [2024-11-19 15:02:27,666 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:27,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:27,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:27,675 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:27,676 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [144, 144, 120, 120, 120, 36, 36, 24, 24, 24, 24, 24, 24, 24, 16, 16, 12, 12, 12, 12, 12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:27,676 INFO L745 eck$LassoCheckResult]: Stem: 10392#$Ultimate##0 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); 10373#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 10363#L128 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);< 10384#$Ultimate##0 [2024-11-19 15:02:27,677 INFO L747 eck$LassoCheckResult]: Loop: 10384#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 10371#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 10368#L107 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);< 10372#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 10366#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 10369#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 10380#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10385#L41-1 assume true; 10382#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10383#L41-1 assume true; 10418#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10417#L41-1 assume true; 10416#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10388#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 10375#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 10380#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10385#L41-1 assume true; 10382#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10383#L41-1 assume true; 10418#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10417#L41-1 assume true; 10416#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10388#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 10375#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 10380#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10385#L41-1 assume true; 10382#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10383#L41-1 assume true; 10418#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10417#L41-1 assume true; 10416#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10388#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 10375#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 10391#L61-1 assume true; 10374#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10376#L61-1 assume true; 10389#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10408#L61-1 assume true; 10404#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10400#L61-1 assume true; 10399#func_to_recursive_line_25_to_26_0EXIT >#98#return; 10387#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 10367#L92 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);< 10372#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 10366#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 10369#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 10380#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10385#L41-1 assume true; 10382#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10383#L41-1 assume true; 10418#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10417#L41-1 assume true; 10416#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10388#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 10375#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 10380#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10385#L41-1 assume true; 10382#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10383#L41-1 assume true; 10418#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10417#L41-1 assume true; 10416#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10388#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 10375#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 10380#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10385#L41-1 assume true; 10382#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10383#L41-1 assume true; 10418#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10417#L41-1 assume true; 10416#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10388#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 10375#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 10391#L61-1 assume true; 10374#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10376#L61-1 assume true; 10389#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10408#L61-1 assume true; 10404#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10400#L61-1 assume true; 10399#func_to_recursive_line_25_to_26_0EXIT >#98#return; 10387#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 10367#L92 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);< 10372#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 10366#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 10369#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 10380#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10385#L41-1 assume true; 10382#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10383#L41-1 assume true; 10418#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10417#L41-1 assume true; 10416#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10388#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 10375#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 10380#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10385#L41-1 assume true; 10382#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10383#L41-1 assume true; 10418#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10417#L41-1 assume true; 10416#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10388#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 10375#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 10380#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10385#L41-1 assume true; 10382#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10383#L41-1 assume true; 10418#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10417#L41-1 assume true; 10416#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10388#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 10375#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 10391#L61-1 assume true; 10374#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10376#L61-1 assume true; 10389#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10408#L61-1 assume true; 10404#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10400#L61-1 assume true; 10399#func_to_recursive_line_25_to_26_0EXIT >#98#return; 10387#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 10367#L92 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);< 10372#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 10366#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 10369#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 10380#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10385#L41-1 assume true; 10382#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10383#L41-1 assume true; 10418#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10417#L41-1 assume true; 10416#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10388#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 10375#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 10380#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10385#L41-1 assume true; 10382#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10383#L41-1 assume true; 10418#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10417#L41-1 assume true; 10416#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10388#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 10375#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 10380#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 10359#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10358#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10364#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 10365#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10357#L25-1 assume true; 10360#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10377#L25-1 assume true; 10415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10414#L25-1 assume true; 10413#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10412#L25-1 assume true; 10410#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10409#L25-1 assume true; 10405#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10402#L25-1 assume true; 10401#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10395#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 10379#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10378#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 10381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10385#L41-1 assume true; 10382#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10383#L41-1 assume true; 10418#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10417#L41-1 assume true; 10416#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10388#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 10375#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10386#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 10390#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 10391#L61-1 assume true; 10374#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10376#L61-1 assume true; 10389#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10408#L61-1 assume true; 10404#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10400#L61-1 assume true; 10399#func_to_recursive_line_25_to_26_0EXIT >#98#return; 10387#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 10367#L92 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);< 10372#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 10366#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 10370#L81-1 assume true; 10393#func_to_recursive_line_24_to_25_0EXIT >#100#return; 10394#L81-1 assume true; 10396#func_to_recursive_line_24_to_25_0EXIT >#100#return; 10411#L81-1 assume true; 10407#func_to_recursive_line_24_to_25_0EXIT >#100#return; 10406#L81-1 assume true; 10403#func_to_recursive_line_24_to_25_0EXIT >#100#return; 10398#L81-1 assume true; 10397#func_to_recursive_line_24_to_25_0EXIT >#112#return; 10361#L107-1 call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 10362#L112 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);< 10384#$Ultimate##0 [2024-11-19 15:02:27,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:27,683 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 11 times [2024-11-19 15:02:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:27,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085428437] [2024-11-19 15:02:27,683 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 15:02:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:27,700 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:02:27,703 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:27,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:27,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:27,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1420389645, now seen corresponding path program 7 times [2024-11-19 15:02:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:27,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442781403] [2024-11-19 15:02:27,725 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 15:02:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 52408 backedges. 71 proven. 572 refuted. 0 times theorem prover too weak. 51765 trivial. 0 not checked. [2024-11-19 15:02:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442781403] [2024-11-19 15:02:32,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442781403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276647882] [2024-11-19 15:02:32,358 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 15:02:32,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:32,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:32,359 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:32,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 15:02:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:33,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 6324 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-19 15:02:33,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:33,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 15:02:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 52408 backedges. 28316 proven. 35 refuted. 0 times theorem prover too weak. 24057 trivial. 0 not checked. [2024-11-19 15:02:33,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 52408 backedges. 2154 proven. 2012 refuted. 0 times theorem prover too weak. 48242 trivial. 0 not checked. [2024-11-19 15:02:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276647882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:40,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:40,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 26] total 46 [2024-11-19 15:02:40,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876114509] [2024-11-19 15:02:40,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:40,458 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-19 15:02:40,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1748, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 15:02:40,460 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. cyclomatic complexity: 13 Second operand has 46 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 38 states have internal predecessors, (82), 14 states have call successors, (32), 10 states have call predecessors, (32), 17 states have return successors, (39), 16 states have call predecessors, (39), 14 states have call successors, (39) [2024-11-19 15:02:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:41,057 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-11-19 15:02:41,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2024-11-19 15:02:41,058 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:41,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 74 transitions. [2024-11-19 15:02:41,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2024-11-19 15:02:41,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-11-19 15:02:41,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 74 transitions. [2024-11-19 15:02:41,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:41,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-19 15:02:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 74 transitions. [2024-11-19 15:02:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-19 15:02:41,062 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) [2024-11-19 15:02:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-11-19 15:02:41,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-19 15:02:41,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 15:02:41,064 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-19 15:02:41,064 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 15:02:41,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 74 transitions. [2024-11-19 15:02:41,064 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:02:41,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:41,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:41,068 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:41,068 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [252, 252, 216, 216, 216, 48, 48, 36, 36, 36, 36, 36, 36, 36, 16, 16, 12, 12, 12, 12, 12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:41,068 INFO L745 eck$LassoCheckResult]: Stem: 16890#$Ultimate##0 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); 16869#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 16859#L128 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);< 16881#$Ultimate##0 [2024-11-19 15:02:41,070 INFO L747 eck$LassoCheckResult]: Loop: 16881#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 16867#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 16863#L107 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);< 16868#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 16862#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 16865#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 16876#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16880#L41-1 assume true; 16878#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16879#L41-1 assume true; 16918#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16917#L41-1 assume true; 16916#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16915#L41-1 assume true; 16914#func_to_recursive_line_26_to_27_0EXIT >#102#return; 16884#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 16871#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 16876#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16880#L41-1 assume true; 16878#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16879#L41-1 assume true; 16918#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16917#L41-1 assume true; 16916#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16915#L41-1 assume true; 16914#func_to_recursive_line_26_to_27_0EXIT >#102#return; 16884#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 16871#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 16876#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16880#L41-1 assume true; 16878#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16879#L41-1 assume true; 16918#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16917#L41-1 assume true; 16916#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16915#L41-1 assume true; 16914#func_to_recursive_line_26_to_27_0EXIT >#102#return; 16884#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 16871#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 16887#L61-1 assume true; 16870#func_to_recursive_line_25_to_26_0EXIT >#104#return; 16872#L61-1 assume true; 16885#func_to_recursive_line_25_to_26_0EXIT >#104#return; 16904#L61-1 assume true; 16900#func_to_recursive_line_25_to_26_0EXIT >#104#return; 16896#L61-1 assume true; 16895#func_to_recursive_line_25_to_26_0EXIT >#98#return; 16883#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 16864#L92 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);< 16868#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 16862#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 16865#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 16876#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16880#L41-1 assume true; 16878#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16879#L41-1 assume true; 16918#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16917#L41-1 assume true; 16916#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16915#L41-1 assume true; 16914#func_to_recursive_line_26_to_27_0EXIT >#102#return; 16884#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 16871#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 16876#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16880#L41-1 assume true; 16878#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16879#L41-1 assume true; 16918#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16917#L41-1 assume true; 16916#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16915#L41-1 assume true; 16914#func_to_recursive_line_26_to_27_0EXIT >#102#return; 16884#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 16871#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 16876#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16880#L41-1 assume true; 16878#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16879#L41-1 assume true; 16918#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16917#L41-1 assume true; 16916#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16915#L41-1 assume true; 16914#func_to_recursive_line_26_to_27_0EXIT >#102#return; 16884#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 16871#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 16887#L61-1 assume true; 16870#func_to_recursive_line_25_to_26_0EXIT >#104#return; 16872#L61-1 assume true; 16885#func_to_recursive_line_25_to_26_0EXIT >#104#return; 16904#L61-1 assume true; 16900#func_to_recursive_line_25_to_26_0EXIT >#104#return; 16896#L61-1 assume true; 16895#func_to_recursive_line_25_to_26_0EXIT >#98#return; 16883#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 16864#L92 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);< 16868#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 16862#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 16865#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 16876#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16880#L41-1 assume true; 16878#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16879#L41-1 assume true; 16918#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16917#L41-1 assume true; 16916#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16915#L41-1 assume true; 16914#func_to_recursive_line_26_to_27_0EXIT >#102#return; 16884#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 16871#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 16876#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16880#L41-1 assume true; 16878#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16879#L41-1 assume true; 16918#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16917#L41-1 assume true; 16916#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16915#L41-1 assume true; 16914#func_to_recursive_line_26_to_27_0EXIT >#102#return; 16884#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 16871#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 16876#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16880#L41-1 assume true; 16878#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16879#L41-1 assume true; 16918#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16917#L41-1 assume true; 16916#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16915#L41-1 assume true; 16914#func_to_recursive_line_26_to_27_0EXIT >#102#return; 16884#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 16871#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 16887#L61-1 assume true; 16870#func_to_recursive_line_25_to_26_0EXIT >#104#return; 16872#L61-1 assume true; 16885#func_to_recursive_line_25_to_26_0EXIT >#104#return; 16904#L61-1 assume true; 16900#func_to_recursive_line_25_to_26_0EXIT >#104#return; 16896#L61-1 assume true; 16895#func_to_recursive_line_25_to_26_0EXIT >#98#return; 16883#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 16864#L92 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);< 16868#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 16862#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 16865#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 16876#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16880#L41-1 assume true; 16878#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16879#L41-1 assume true; 16918#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16917#L41-1 assume true; 16916#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16915#L41-1 assume true; 16914#func_to_recursive_line_26_to_27_0EXIT >#102#return; 16884#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 16871#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 16876#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16880#L41-1 assume true; 16878#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16879#L41-1 assume true; 16918#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16917#L41-1 assume true; 16916#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16915#L41-1 assume true; 16914#func_to_recursive_line_26_to_27_0EXIT >#102#return; 16884#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 16871#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 16876#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 16855#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 16854#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 16860#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 16861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16853#L25-1 assume true; 16856#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16873#L25-1 assume true; 16913#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16912#L25-1 assume true; 16911#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16910#L25-1 assume true; 16909#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16908#L25-1 assume true; 16906#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16905#L25-1 assume true; 16901#func_to_recursive_line_27_to_27_0EXIT >#106#return; 16898#L25-1 assume true; 16897#func_to_recursive_line_27_to_27_0EXIT >#108#return; 16891#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 16875#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 16874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 16877#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16880#L41-1 assume true; 16878#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16879#L41-1 assume true; 16918#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16917#L41-1 assume true; 16916#func_to_recursive_line_26_to_27_0EXIT >#110#return; 16915#L41-1 assume true; 16914#func_to_recursive_line_26_to_27_0EXIT >#102#return; 16884#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 16871#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16882#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 16886#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 16887#L61-1 assume true; 16870#func_to_recursive_line_25_to_26_0EXIT >#104#return; 16872#L61-1 assume true; 16885#func_to_recursive_line_25_to_26_0EXIT >#104#return; 16904#L61-1 assume true; 16900#func_to_recursive_line_25_to_26_0EXIT >#104#return; 16896#L61-1 assume true; 16895#func_to_recursive_line_25_to_26_0EXIT >#98#return; 16883#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 16864#L92 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);< 16868#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 16862#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 16866#L81-1 assume true; 16888#func_to_recursive_line_24_to_25_0EXIT >#100#return; 16889#L81-1 assume true; 16892#func_to_recursive_line_24_to_25_0EXIT >#100#return; 16907#L81-1 assume true; 16903#func_to_recursive_line_24_to_25_0EXIT >#100#return; 16902#L81-1 assume true; 16899#func_to_recursive_line_24_to_25_0EXIT >#100#return; 16894#L81-1 assume true; 16893#func_to_recursive_line_24_to_25_0EXIT >#112#return; 16857#L107-1 call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 16858#L112 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);< 16881#$Ultimate##0 [2024-11-19 15:02:41,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:41,071 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 12 times [2024-11-19 15:02:41,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:41,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994702068] [2024-11-19 15:02:41,072 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 15:02:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:41,079 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 15:02:41,079 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:41,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:41,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:41,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash -990579997, now seen corresponding path program 8 times [2024-11-19 15:02:41,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:41,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757195048] [2024-11-19 15:02:41,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:41,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:41,691 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 15:02:41,692 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 156862 backedges. 318 proven. 787 refuted. 0 times theorem prover too weak. 155757 trivial. 0 not checked. [2024-11-19 15:02:50,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757195048] [2024-11-19 15:02:50,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757195048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9866674] [2024-11-19 15:02:50,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:50,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:50,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:50,186 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:50,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 15:02:51,982 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 15:02:51,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:52,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 9684 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-19 15:02:52,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:52,107 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 [2024-11-19 15:02:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 156862 backedges. 59117 proven. 15 refuted. 0 times theorem prover too weak. 97730 trivial. 0 not checked. [2024-11-19 15:02:52,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 156862 backedges. 8 proven. 315 refuted. 0 times theorem prover too weak. 156539 trivial. 0 not checked. [2024-11-19 15:02:59,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9866674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:59,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:59,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 18] total 39 [2024-11-19 15:02:59,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140010481] [2024-11-19 15:02:59,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:59,477 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:59,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:59,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-19 15:02:59,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2024-11-19 15:02:59,478 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. cyclomatic complexity: 13 Second operand has 39 states, 30 states have (on average 2.7) internal successors, (81), 33 states have internal predecessors, (81), 17 states have call successors, (33), 8 states have call predecessors, (33), 14 states have return successors, (37), 17 states have call predecessors, (37), 17 states have call successors, (37) [2024-11-19 15:03:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:03:00,208 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-11-19 15:03:00,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 78 transitions. [2024-11-19 15:03:00,209 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:03:00,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 78 transitions. [2024-11-19 15:03:00,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2024-11-19 15:03:00,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2024-11-19 15:03:00,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 78 transitions. [2024-11-19 15:03:00,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:03:00,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-19 15:03:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 78 transitions. [2024-11-19 15:03:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-19 15:03:00,216 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) [2024-11-19 15:03:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-11-19 15:03:00,216 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-19 15:03:00,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 15:03:00,217 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-19 15:03:00,217 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-19 15:03:00,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 78 transitions. [2024-11-19 15:03:00,219 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-19 15:03:00,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:03:00,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:03:00,226 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:03:00,228 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [448, 448, 384, 384, 384, 80, 80, 64, 64, 64, 64, 64, 64, 64, 20, 20, 16, 16, 16, 16, 16, 16, 16, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:03:00,228 INFO L745 eck$LassoCheckResult]: Stem: 27056#$Ultimate##0 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); 27036#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 27021#L128 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);< 27047#$Ultimate##0 [2024-11-19 15:03:00,230 INFO L747 eck$LassoCheckResult]: Loop: 27047#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#3(~a.base, ~a.offset, 4); 27034#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 27030#L107 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);< 27035#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 27029#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 27032#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 27052#L61-1 assume true; 27037#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27039#L61-1 assume true; 27076#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27075#L61-1 assume true; 27070#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27069#L61-1 assume true; 27065#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27061#L61-1 assume true; 27060#func_to_recursive_line_25_to_26_0EXIT >#98#return; 27050#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 27031#L92 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);< 27035#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 27029#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 27032#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 27052#L61-1 assume true; 27037#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27039#L61-1 assume true; 27076#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27075#L61-1 assume true; 27070#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27069#L61-1 assume true; 27065#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27061#L61-1 assume true; 27060#func_to_recursive_line_25_to_26_0EXIT >#98#return; 27050#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 27031#L92 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);< 27035#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 27029#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 27032#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 27052#L61-1 assume true; 27037#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27039#L61-1 assume true; 27076#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27075#L61-1 assume true; 27070#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27069#L61-1 assume true; 27065#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27061#L61-1 assume true; 27060#func_to_recursive_line_25_to_26_0EXIT >#98#return; 27050#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 27031#L92 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);< 27035#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 27029#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4); 27032#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~d.base, ~d.offset, 4); 27042#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~e.base, ~e.offset, 4); 27024#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 27025#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 27027#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#2(~e.base, ~e.offset, 4); 27028#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 27023#L25-1 assume true; 27026#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27040#L25-1 assume true; 27082#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27081#L25-1 assume true; 27080#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27079#L25-1 assume true; 27078#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27077#L25-1 assume true; 27072#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27071#L25-1 assume true; 27066#func_to_recursive_line_27_to_27_0EXIT >#106#return; 27063#L25-1 assume true; 27062#func_to_recursive_line_27_to_27_0EXIT >#108#return; 27057#L47-1 call #t~mem8 := read~int#1(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 27043#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 27041#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#1(~d.base, ~d.offset, 4); 27044#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 27048#L41-1 assume true; 27045#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27046#L41-1 assume true; 27089#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27088#L41-1 assume true; 27087#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27086#L41-1 assume true; 27085#func_to_recursive_line_26_to_27_0EXIT >#110#return; 27084#L41-1 assume true; 27083#func_to_recursive_line_26_to_27_0EXIT >#102#return; 27051#L67-1 call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 27038#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 27049#$Ultimate##0 ~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#5(~c.base, ~c.offset, 4); 27053#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 27052#L61-1 assume true; 27037#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27039#L61-1 assume true; 27076#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27075#L61-1 assume true; 27070#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27069#L61-1 assume true; 27065#func_to_recursive_line_25_to_26_0EXIT >#104#return; 27061#L61-1 assume true; 27060#func_to_recursive_line_25_to_26_0EXIT >#98#return; 27050#L87-1 call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 27031#L92 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);< 27035#$Ultimate##0 ~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#4(~b.base, ~b.offset, 4); 27029#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 27033#L81-1 assume true; 27054#func_to_recursive_line_24_to_25_0EXIT >#100#return; 27055#L81-1 assume true; 27074#func_to_recursive_line_24_to_25_0EXIT >#100#return; 27073#L81-1 assume true; 27068#func_to_recursive_line_24_to_25_0EXIT >#100#return; 27067#L81-1 assume true; 27064#func_to_recursive_line_24_to_25_0EXIT >#100#return; 27059#L81-1 assume true; 27058#func_to_recursive_line_24_to_25_0EXIT >#112#return; 27020#L107-1 call #t~mem17 := read~int#3(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#3(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 27022#L112 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);< 27047#$Ultimate##0 [2024-11-19 15:03:00,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 13 times [2024-11-19 15:03:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:00,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882600875] [2024-11-19 15:03:00,233 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 15:03:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:03:00,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:03:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:03:00,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:03:00,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1128042717, now seen corresponding path program 9 times [2024-11-19 15:03:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:00,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055081237] [2024-11-19 15:03:00,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:03:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:03,622 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2024-11-19 15:03:03,623 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:03:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 493914 backedges. 2443 proven. 32 refuted. 0 times theorem prover too weak. 491439 trivial. 0 not checked. [2024-11-19 15:03:17,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055081237] [2024-11-19 15:03:17,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055081237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:03:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420880456] [2024-11-19 15:03:17,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:03:17,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:03:17,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:17,094 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:03:17,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process