./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 01:01:33,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 01:01:33,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 01:01:33,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 01:01:33,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 01:01:34,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 01:01:34,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 01:01:34,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 01:01:34,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 01:01:34,018 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 01:01:34,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 01:01:34,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 01:01:34,020 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 01:01:34,020 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 01:01:34,022 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 01:01:34,022 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 01:01:34,022 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 01:01:34,022 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 01:01:34,022 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 01:01:34,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 01:01:34,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 01:01:34,025 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 01:01:34,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 01:01:34,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 01:01:34,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 01:01:34,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 01:01:34,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 01:01:34,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 01:01:34,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 01:01:34,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 01:01:34,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 01:01:34,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 01:01:34,028 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 01:01:34,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 01:01:34,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 01:01:34,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 01:01:34,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 01:01:34,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 01:01:34,029 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 01:01:34,029 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-clean/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-clean/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 -> 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c [2024-10-12 01:01:34,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 01:01:34,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 01:01:34,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 01:01:34,249 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 01:01:34,249 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 01:01:34,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-10-12 01:01:35,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 01:01:35,588 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 01:01:35,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-10-12 01:01:35,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/34e443eaa/55c404f140c144fd96ef945ea659a37b/FLAG20e79fbf9 [2024-10-12 01:01:35,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/34e443eaa/55c404f140c144fd96ef945ea659a37b [2024-10-12 01:01:35,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 01:01:35,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 01:01:35,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 01:01:35,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 01:01:35,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 01:01:35,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@86ccbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35, skipping insertion in model container [2024-10-12 01:01:35,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 01:01:35,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:01:35,778 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 01:01:35,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:01:35,804 INFO L204 MainTranslator]: Completed translation [2024-10-12 01:01:35,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35 WrapperNode [2024-10-12 01:01:35,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 01:01:35,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 01:01:35,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 01:01:35,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 01:01:35,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,833 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-10-12 01:01:35,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 01:01:35,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 01:01:35,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 01:01:35,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 01:01:35,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,856 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2024-10-12 01:01:35,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 01:01:35,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 01:01:35,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 01:01:35,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 01:01:35,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:01:35,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:35,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:01:35,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 01:01:35,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 01:01:35,937 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2024-10-12 01:01:35,937 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2024-10-12 01:01:35,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 01:01:35,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 01:01:35,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 01:01:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 01:01:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 01:01:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 01:01:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 01:01:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 01:01:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 01:01:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 01:01:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-12 01:01:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-10-12 01:01:35,940 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-10-12 01:01:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2024-10-12 01:01:35,940 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2024-10-12 01:01:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 01:01:35,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 01:01:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 01:01:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 01:01:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 01:01:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 01:01:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-12 01:01:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-10-12 01:01:35,941 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-10-12 01:01:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 01:01:36,032 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 01:01:36,038 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 01:01:36,261 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-12 01:01:36,261 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 01:01:36,278 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 01:01:36,278 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 01:01:36,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:01:36 BoogieIcfgContainer [2024-10-12 01:01:36,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 01:01:36,280 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 01:01:36,280 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 01:01:36,283 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 01:01:36,284 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:01:36,284 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 01:01:35" (1/3) ... [2024-10-12 01:01:36,285 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@439239a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:01:36, skipping insertion in model container [2024-10-12 01:01:36,285 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:01:36,285 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35" (2/3) ... [2024-10-12 01:01:36,286 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@439239a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:01:36, skipping insertion in model container [2024-10-12 01:01:36,286 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:01:36,287 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:01:36" (3/3) ... [2024-10-12 01:01:36,288 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2024-10-12 01:01:36,334 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 01:01:36,335 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 01:01:36,335 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 01:01:36,335 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 01:01:36,335 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 01:01:36,335 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 01:01:36,335 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 01:01:36,335 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 01:01:36,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 01:01:36,357 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-12 01:01:36,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:36,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:36,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:01:36,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 01:01:36,362 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 01:01:36,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 01:01:36,365 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-12 01:01:36,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:36,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:36,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:01:36,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 01:01:36,371 INFO L745 eck$LassoCheckResult]: Stem: 44#$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); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 34#L109-2true [2024-10-12 01:01:36,371 INFO L747 eck$LassoCheckResult]: Loop: 34#L109-2true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11#L114-2true assume !(main_~b~0#1 < 6); 5#L114-3true main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 34#L109-2true [2024-10-12 01:01:36,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:36,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2024-10-12 01:01:36,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:36,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963450105] [2024-10-12 01:01:36,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:36,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:36,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:36,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:36,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 71729, now seen corresponding path program 1 times [2024-10-12 01:01:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:36,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115239146] [2024-10-12 01:01:36,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:36,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:01:36,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:36,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115239146] [2024-10-12 01:01:36,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115239146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:01:36,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:01:36,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 01:01:36,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569717223] [2024-10-12 01:01:36,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:01:36,558 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:36,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:36,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:01:36,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:01:36,592 INFO L87 Difference]: Start difference. First operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:01:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:36,622 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-10-12 01:01:36,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2024-10-12 01:01:36,626 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2024-10-12 01:01:36,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 36 states and 46 transitions. [2024-10-12 01:01:36,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-12 01:01:36,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-10-12 01:01:36,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2024-10-12 01:01:36,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:36,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-10-12 01:01:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2024-10-12 01:01:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-10-12 01:01:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 01:01:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-10-12 01:01:36,668 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-10-12 01:01:36,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:01:36,689 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-10-12 01:01:36,689 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 01:01:36,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2024-10-12 01:01:36,690 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-12 01:01:36,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:36,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:36,691 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:01:36,696 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:36,696 INFO L745 eck$LassoCheckResult]: Stem: 138#$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); 120#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 109#L109-2 [2024-10-12 01:01:36,697 INFO L747 eck$LassoCheckResult]: Loop: 109#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 118#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 119#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 135#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 134#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 124#L81-1 assume true; 121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 123#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 136#L114-2 assume !(main_~b~0#1 < 6); 108#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 109#L109-2 [2024-10-12 01:01:36,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2024-10-12 01:01:36,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:36,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593851847] [2024-10-12 01:01:36,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:36,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:36,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:36,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1371427203, now seen corresponding path program 1 times [2024-10-12 01:01:36,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:36,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124356042] [2024-10-12 01:01:36,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:36,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:01:36,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:36,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124356042] [2024-10-12 01:01:36,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124356042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:01:36,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:01:36,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 01:01:36,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992634270] [2024-10-12 01:01:36,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:01:36,997 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:36,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:36,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 01:01:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 01:01:36,998 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 01:01:37,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:37,201 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-10-12 01:01:37,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2024-10-12 01:01:37,203 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-12 01:01:37,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 54 transitions. [2024-10-12 01:01:37,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-12 01:01:37,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-12 01:01:37,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2024-10-12 01:01:37,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:37,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-10-12 01:01:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2024-10-12 01:01:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-10-12 01:01:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-12 01:01:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-10-12 01:01:37,214 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-12 01:01:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 01:01:37,215 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-12 01:01:37,215 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 01:01:37,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2024-10-12 01:01:37,216 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-12 01:01:37,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:37,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:37,216 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:01:37,217 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:37,217 INFO L745 eck$LassoCheckResult]: Stem: 232#$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); 211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 205#L109-2 [2024-10-12 01:01:37,217 INFO L747 eck$LassoCheckResult]: Loop: 205#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 212#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 213#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 228#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 227#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 202#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 203#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 220#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 223#L61-1 assume true; 224#func_to_recursive_line_26_to_27_0EXIT >#115#return; 225#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 215#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 228#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 227#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 222#L81-1 assume true; 214#func_to_recursive_line_25_to_26_0EXIT >#117#return; 216#L81-1 assume true; 233#func_to_recursive_line_25_to_26_0EXIT >#123#return; 229#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 230#L114-2 assume !(main_~b~0#1 < 6); 204#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 205#L109-2 [2024-10-12 01:01:37,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:37,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times [2024-10-12 01:01:37,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:37,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629745128] [2024-10-12 01:01:37,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:37,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:37,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:37,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:37,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash 182328154, now seen corresponding path program 1 times [2024-10-12 01:01:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:37,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968769196] [2024-10-12 01:01:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:37,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:37,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:37,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 01:01:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 01:01:37,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:37,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968769196] [2024-10-12 01:01:37,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968769196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:01:37,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:01:37,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 01:01:37,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022827804] [2024-10-12 01:01:37,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:01:37,535 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:37,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:37,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 01:01:37,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 01:01:37,536 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 01:01:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:37,682 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-10-12 01:01:37,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2024-10-12 01:01:37,683 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-12 01:01:37,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 53 transitions. [2024-10-12 01:01:37,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-12 01:01:37,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-12 01:01:37,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-10-12 01:01:37,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:37,685 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-12 01:01:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-10-12 01:01:37,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-10-12 01:01:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-12 01:01:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-10-12 01:01:37,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-12 01:01:37,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 01:01:37,693 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-12 01:01:37,694 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 01:01:37,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2024-10-12 01:01:37,695 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-12 01:01:37,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:37,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:37,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:01:37,695 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, 1] [2024-10-12 01:01:37,696 INFO L745 eck$LassoCheckResult]: Stem: 348#$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); 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 320#L109-2 [2024-10-12 01:01:37,696 INFO L747 eck$LassoCheckResult]: Loop: 320#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 327#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 328#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 344#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 342#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 317#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 335#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 314#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 332#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 333#L41-1 assume true; 334#func_to_recursive_line_27_to_28_0EXIT >#125#return; 341#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 316#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 335#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 338#L61-1 assume true; 339#func_to_recursive_line_26_to_27_0EXIT >#127#return; 340#L61-1 assume true; 349#func_to_recursive_line_26_to_27_0EXIT >#115#return; 343#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 330#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 344#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 342#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 337#L81-1 assume true; 329#func_to_recursive_line_25_to_26_0EXIT >#117#return; 331#L81-1 assume true; 350#func_to_recursive_line_25_to_26_0EXIT >#123#return; 345#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 346#L114-2 assume !(main_~b~0#1 < 6); 319#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 320#L109-2 [2024-10-12 01:01:37,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times [2024-10-12 01:01:37,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:37,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923471991] [2024-10-12 01:01:37,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:37,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:37,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:37,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:37,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2098832724, now seen corresponding path program 1 times [2024-10-12 01:01:37,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:37,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894203235] [2024-10-12 01:01:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:37,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 01:01:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 01:01:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 01:01:38,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894203235] [2024-10-12 01:01:38,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894203235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:01:38,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:01:38,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 01:01:38,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460121428] [2024-10-12 01:01:38,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:01:38,103 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:38,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:38,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 01:01:38,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 01:01:38,105 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 01:01:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:38,237 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-10-12 01:01:38,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-10-12 01:01:38,238 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-12 01:01:38,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-10-12 01:01:38,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-12 01:01:38,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-12 01:01:38,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-10-12 01:01:38,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:38,243 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-10-12 01:01:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-10-12 01:01:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-10-12 01:01:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-12 01:01:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-10-12 01:01:38,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-10-12 01:01:38,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 01:01:38,250 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-10-12 01:01:38,250 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 01:01:38,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-10-12 01:01:38,250 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-12 01:01:38,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:38,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:38,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:01:38,253 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, 1] [2024-10-12 01:01:38,253 INFO L745 eck$LassoCheckResult]: Stem: 497#$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); 476#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 468#L109-2 [2024-10-12 01:01:38,254 INFO L747 eck$LassoCheckResult]: Loop: 468#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 474#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 475#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 492#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 490#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 465#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 466#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 483#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 463#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 473#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 480#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 470#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 469#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 472#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 484#L25-1 assume true; 496#func_to_recursive_line_28_to_28_0EXIT >#119#return; 461#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 462#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 473#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 480#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 481#L41-1 assume true; 482#func_to_recursive_line_27_to_28_0EXIT >#121#return; 489#L41-1 assume true; 498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 493#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 464#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 466#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 483#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 486#L61-1 assume true; 487#func_to_recursive_line_26_to_27_0EXIT >#127#return; 488#L61-1 assume true; 499#func_to_recursive_line_26_to_27_0EXIT >#115#return; 491#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 478#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 492#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 490#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 485#L81-1 assume true; 477#func_to_recursive_line_25_to_26_0EXIT >#117#return; 479#L81-1 assume true; 500#func_to_recursive_line_25_to_26_0EXIT >#123#return; 494#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 495#L114-2 assume !(main_~b~0#1 < 6); 467#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 468#L109-2 [2024-10-12 01:01:38,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times [2024-10-12 01:01:38,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:38,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103432988] [2024-10-12 01:01:38,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:38,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:38,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:38,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:38,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:38,270 INFO L85 PathProgramCache]: Analyzing trace with hash 500602406, now seen corresponding path program 1 times [2024-10-12 01:01:38,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:38,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161259599] [2024-10-12 01:01:38,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:38,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 01:01:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 01:01:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 01:01:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 01:01:38,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:38,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161259599] [2024-10-12 01:01:38,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161259599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:01:38,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:01:38,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 01:01:38,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880052612] [2024-10-12 01:01:38,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:01:38,646 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:38,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:38,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 01:01:38,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 01:01:38,646 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 01:01:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:38,789 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-12 01:01:38,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-10-12 01:01:38,790 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-12 01:01:38,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-10-12 01:01:38,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-12 01:01:38,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-12 01:01:38,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-10-12 01:01:38,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:38,792 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-12 01:01:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-10-12 01:01:38,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-12 01:01:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-12 01:01:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-10-12 01:01:38,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-12 01:01:38,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 01:01:38,800 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-12 01:01:38,800 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 01:01:38,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2024-10-12 01:01:38,800 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-12 01:01:38,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:38,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:38,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:01:38,804 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, 1] [2024-10-12 01:01:38,804 INFO L745 eck$LassoCheckResult]: Stem: 691#$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); 668#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 660#L109-2 [2024-10-12 01:01:38,804 INFO L747 eck$LassoCheckResult]: Loop: 660#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 666#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 667#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 684#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 682#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 657#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 658#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 675#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 654#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 665#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 672#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 662#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 661#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 664#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 663#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 661#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 664#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 676#L25-1 assume true; 690#func_to_recursive_line_28_to_28_0EXIT >#113#return; 688#L25-1 assume true; 689#func_to_recursive_line_28_to_28_0EXIT >#119#return; 653#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 655#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 665#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 672#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 673#L41-1 assume true; 674#func_to_recursive_line_27_to_28_0EXIT >#121#return; 681#L41-1 assume true; 692#func_to_recursive_line_27_to_28_0EXIT >#125#return; 685#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 656#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 658#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 675#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 678#L61-1 assume true; 679#func_to_recursive_line_26_to_27_0EXIT >#127#return; 680#L61-1 assume true; 693#func_to_recursive_line_26_to_27_0EXIT >#115#return; 683#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 670#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 684#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 682#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 677#L81-1 assume true; 669#func_to_recursive_line_25_to_26_0EXIT >#117#return; 671#L81-1 assume true; 694#func_to_recursive_line_25_to_26_0EXIT >#123#return; 686#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 687#L114-2 assume !(main_~b~0#1 < 6); 659#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 660#L109-2 [2024-10-12 01:01:38,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times [2024-10-12 01:01:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:38,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720671652] [2024-10-12 01:01:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:38,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:38,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:38,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1994055486, now seen corresponding path program 1 times [2024-10-12 01:01:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:38,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429314257] [2024-10-12 01:01:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 01:01:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 01:01:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 01:01:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 01:01:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429314257] [2024-10-12 01:01:39,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429314257] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076819859] [2024-10-12 01:01:39,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:39,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:39,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:39,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:01:39,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 01:01:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 01:01:39,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:39,640 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 01:01:39,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 01:01:39,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076819859] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:39,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:39,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 16 [2024-10-12 01:01:39,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622986541] [2024-10-12 01:01:39,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:39,736 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:39,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 01:01:39,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-12 01:01:39,737 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. cyclomatic complexity: 14 Second operand has 16 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-12 01:01:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:40,002 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-10-12 01:01:40,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2024-10-12 01:01:40,003 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-10-12 01:01:40,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 65 transitions. [2024-10-12 01:01:40,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-10-12 01:01:40,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-10-12 01:01:40,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 65 transitions. [2024-10-12 01:01:40,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:40,005 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-10-12 01:01:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 65 transitions. [2024-10-12 01:01:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-12 01:01:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 36 states have internal predecessors, (38), 11 states have call successors, (11), 4 states have call predecessors, (11), 9 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2024-10-12 01:01:40,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2024-10-12 01:01:40,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-10-12 01:01:40,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 01:01:40,014 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-10-12 01:01:40,014 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 01:01:40,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 65 transitions. [2024-10-12 01:01:40,015 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-10-12 01:01:40,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:40,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:40,018 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:01:40,018 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2024-10-12 01:01:40,018 INFO L745 eck$LassoCheckResult]: Stem: 1213#$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); 1188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 1180#L109-2 [2024-10-12 01:01:40,018 INFO L747 eck$LassoCheckResult]: Loop: 1180#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1186#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1187#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 1177#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 1174#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 1183#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1199#L25-1 assume true; 1211#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1212#L25-1 assume true; 1220#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1215#L25-1 assume true; 1214#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1173#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1175#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1196#L41-1 assume true; 1197#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1204#L41-1 assume true; 1216#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1208#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1176#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1201#L61-1 assume true; 1202#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1203#L61-1 assume true; 1217#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1206#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1192#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1200#L81-1 assume true; 1189#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1194#L81-1 assume true; 1221#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1209#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1210#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1191#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 1177#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 1174#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 1183#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1199#L25-1 assume true; 1211#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1212#L25-1 assume true; 1220#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1215#L25-1 assume true; 1214#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1173#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1175#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1196#L41-1 assume true; 1197#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1204#L41-1 assume true; 1216#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1208#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1176#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1201#L61-1 assume true; 1202#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1203#L61-1 assume true; 1217#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1206#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1192#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1200#L81-1 assume true; 1189#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1194#L81-1 assume true; 1221#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1222#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1225#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1193#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 1177#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 1174#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 1183#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1199#L25-1 assume true; 1211#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1212#L25-1 assume true; 1220#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1215#L25-1 assume true; 1214#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1173#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1175#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1196#L41-1 assume true; 1197#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1204#L41-1 assume true; 1216#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1208#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1176#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1201#L61-1 assume true; 1202#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1203#L61-1 assume true; 1217#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1206#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1192#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1200#L81-1 assume true; 1189#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1194#L81-1 assume true; 1221#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1223#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1224#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1190#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 1177#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 1174#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 1183#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1182#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1181#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1184#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1199#L25-1 assume true; 1211#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1212#L25-1 assume true; 1220#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1215#L25-1 assume true; 1214#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1173#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1175#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1185#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 1195#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1196#L41-1 assume true; 1197#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1204#L41-1 assume true; 1216#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1208#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1176#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1178#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 1198#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1201#L61-1 assume true; 1202#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1203#L61-1 assume true; 1217#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1206#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1192#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1207#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1205#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1200#L81-1 assume true; 1189#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1194#L81-1 assume true; 1221#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1219#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1218#L114-2 assume !(main_~b~0#1 < 6); 1179#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 1180#L109-2 [2024-10-12 01:01:40,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:40,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times [2024-10-12 01:01:40,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:40,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414338997] [2024-10-12 01:01:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:40,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:40,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:40,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:40,036 INFO L85 PathProgramCache]: Analyzing trace with hash -607354947, now seen corresponding path program 2 times [2024-10-12 01:01:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:40,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937878425] [2024-10-12 01:01:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:40,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 01:01:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 01:01:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 01:01:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:40,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 01:01:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 01:01:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 01:01:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 01:01:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 01:01:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 01:01:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 01:01:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 01:01:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 45 proven. 59 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-10-12 01:01:41,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:41,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937878425] [2024-10-12 01:01:41,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937878425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:41,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697917538] [2024-10-12 01:01:41,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 01:01:41,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:41,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:41,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:01:41,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 01:01:41,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 01:01:41,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:01:41,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 01:01:41,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2024-10-12 01:01:41,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2024-10-12 01:01:41,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697917538] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:41,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:41,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2024-10-12 01:01:41,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090751632] [2024-10-12 01:01:41,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:41,886 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:41,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:41,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 01:01:41,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-12 01:01:41,887 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. cyclomatic complexity: 17 Second operand has 18 states, 16 states have (on average 3.5) internal successors, (56), 14 states have internal predecessors, (56), 10 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2024-10-12 01:01:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:42,152 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2024-10-12 01:01:42,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 75 transitions. [2024-10-12 01:01:42,153 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-12 01:01:42,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 75 transitions. [2024-10-12 01:01:42,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2024-10-12 01:01:42,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2024-10-12 01:01:42,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 75 transitions. [2024-10-12 01:01:42,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:42,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-10-12 01:01:42,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 75 transitions. [2024-10-12 01:01:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-12 01:01:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.131578947368421) internal successors, (43), 41 states have internal predecessors, (43), 13 states have call successors, (13), 4 states have call predecessors, (13), 10 states have return successors, (19), 15 states have call predecessors, (19), 13 states have call successors, (19) [2024-10-12 01:01:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2024-10-12 01:01:42,157 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-10-12 01:01:42,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 01:01:42,158 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-10-12 01:01:42,158 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 01:01:42,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 75 transitions. [2024-10-12 01:01:42,158 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-12 01:01:42,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:42,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:42,166 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:01:42,167 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-12 01:01:42,167 INFO L745 eck$LassoCheckResult]: Stem: 3160#$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); 3131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 3123#L109-2 [2024-10-12 01:01:42,168 INFO L747 eck$LassoCheckResult]: Loop: 3123#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3129#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3130#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 3120#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 3117#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3141#L41-1 assume true; 3142#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3149#L41-1 assume true; 3166#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3164#L41-1 assume true; 3163#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3154#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3119#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3146#L61-1 assume true; 3147#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3148#L61-1 assume true; 3165#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3152#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3135#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3151#L81-1 assume true; 3132#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3139#L81-1 assume true; 3145#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3155#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3156#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3137#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 3120#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 3117#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3141#L41-1 assume true; 3142#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3149#L41-1 assume true; 3166#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3164#L41-1 assume true; 3163#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3154#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3119#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3146#L61-1 assume true; 3147#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3148#L61-1 assume true; 3165#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3152#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3135#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3151#L81-1 assume true; 3132#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3139#L81-1 assume true; 3145#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3171#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3176#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3138#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 3120#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 3117#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3141#L41-1 assume true; 3142#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3149#L41-1 assume true; 3166#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3164#L41-1 assume true; 3163#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3154#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3119#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3146#L61-1 assume true; 3147#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3148#L61-1 assume true; 3165#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3152#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3135#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3151#L81-1 assume true; 3132#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3139#L81-1 assume true; 3145#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3172#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3175#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3133#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 3120#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 3117#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3141#L41-1 assume true; 3142#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3149#L41-1 assume true; 3166#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3164#L41-1 assume true; 3163#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3154#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3119#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3146#L61-1 assume true; 3147#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3148#L61-1 assume true; 3165#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3152#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3135#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3151#L81-1 assume true; 3132#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3139#L81-1 assume true; 3145#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3169#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3174#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3134#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 3120#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 3117#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3141#L41-1 assume true; 3142#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3149#L41-1 assume true; 3166#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3164#L41-1 assume true; 3163#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3154#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3119#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3146#L61-1 assume true; 3147#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3148#L61-1 assume true; 3165#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3152#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3135#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3151#L81-1 assume true; 3132#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3139#L81-1 assume true; 3145#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3170#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3173#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3136#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 3120#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 3117#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3126#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3125#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3124#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3143#L25-1 assume true; 3159#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3157#L25-1 assume true; 3158#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3162#L25-1 assume true; 3161#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3116#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3118#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3128#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 3140#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3141#L41-1 assume true; 3142#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3149#L41-1 assume true; 3166#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3164#L41-1 assume true; 3163#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3154#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3119#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3121#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 3144#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3146#L61-1 assume true; 3147#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3148#L61-1 assume true; 3165#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3152#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3135#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3153#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3150#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3151#L81-1 assume true; 3132#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3139#L81-1 assume true; 3145#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3168#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3167#L114-2 assume !(main_~b~0#1 < 6); 3122#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 3123#L109-2 [2024-10-12 01:01:42,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times [2024-10-12 01:01:42,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:42,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52356256] [2024-10-12 01:01:42,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:42,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:42,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:42,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:42,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:42,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1998520751, now seen corresponding path program 3 times [2024-10-12 01:01:42,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:42,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465015305] [2024-10-12 01:01:42,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:42,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:43,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:43,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:43,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:43,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 01:01:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 01:01:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 01:01:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 01:01:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 01:01:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-12 01:01:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 01:01:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 01:01:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-12 01:01:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 01:01:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 01:01:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-12 01:01:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 01:01:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 01:01:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-10-12 01:01:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 01:01:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 01:01:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 01:01:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4275 backedges. 55 proven. 468 refuted. 0 times theorem prover too weak. 3752 trivial. 0 not checked. [2024-10-12 01:01:44,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:44,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465015305] [2024-10-12 01:01:44,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465015305] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:44,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890910249] [2024-10-12 01:01:44,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 01:01:44,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:44,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:44,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:01:44,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 01:01:44,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 01:01:44,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:01:44,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 01:01:44,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:44,882 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-10-12 01:01:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4275 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 4161 trivial. 0 not checked. [2024-10-12 01:01:45,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4275 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2024-10-12 01:01:45,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890910249] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:45,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:45,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10] total 30 [2024-10-12 01:01:45,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016773616] [2024-10-12 01:01:45,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:45,941 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:45,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 01:01:45,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2024-10-12 01:01:45,942 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. cyclomatic complexity: 19 Second operand has 30 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 11 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (25), 8 states have call predecessors, (25), 11 states have call successors, (25) [2024-10-12 01:01:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:46,387 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2024-10-12 01:01:46,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 79 transitions. [2024-10-12 01:01:46,388 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-12 01:01:46,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 79 transitions. [2024-10-12 01:01:46,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2024-10-12 01:01:46,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2024-10-12 01:01:46,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 79 transitions. [2024-10-12 01:01:46,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:46,390 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-10-12 01:01:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 79 transitions. [2024-10-12 01:01:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-12 01:01:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 13 states have call successors, (13), 4 states have call predecessors, (13), 12 states have return successors, (21), 17 states have call predecessors, (21), 13 states have call successors, (21) [2024-10-12 01:01:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2024-10-12 01:01:46,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-10-12 01:01:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 01:01:46,396 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-10-12 01:01:46,396 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 01:01:46,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 79 transitions. [2024-10-12 01:01:46,397 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-12 01:01:46,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:46,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:46,404 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:01:46,407 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [96, 96, 72, 72, 72, 36, 36, 24, 24, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-12 01:01:46,408 INFO L745 eck$LassoCheckResult]: Stem: 7479#$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); 7452#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 7441#L109-2 [2024-10-12 01:01:46,409 INFO L747 eck$LassoCheckResult]: Loop: 7441#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 7450#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 7451#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7466#L81-1 assume true; 7453#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7460#L81-1 assume true; 7492#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7487#L81-1 assume true; 7484#func_to_recursive_line_25_to_26_0EXIT >#123#return; 7475#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 7476#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 7459#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7466#L81-1 assume true; 7453#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7460#L81-1 assume true; 7492#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7487#L81-1 assume true; 7484#func_to_recursive_line_25_to_26_0EXIT >#123#return; 7489#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 7497#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 7454#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7466#L81-1 assume true; 7453#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7460#L81-1 assume true; 7492#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7487#L81-1 assume true; 7484#func_to_recursive_line_25_to_26_0EXIT >#123#return; 7485#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 7496#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 7455#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7466#L81-1 assume true; 7453#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7460#L81-1 assume true; 7492#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7487#L81-1 assume true; 7484#func_to_recursive_line_25_to_26_0EXIT >#123#return; 7486#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 7495#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 7457#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7466#L81-1 assume true; 7453#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7460#L81-1 assume true; 7492#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7487#L81-1 assume true; 7484#func_to_recursive_line_25_to_26_0EXIT >#123#return; 7488#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 7491#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 7458#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 7443#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 7438#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 7446#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 7447#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 7445#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 7448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7465#L25-1 assume true; 7477#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7478#L25-1 assume true; 7494#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7493#L25-1 assume true; 7490#func_to_recursive_line_28_to_28_0EXIT >#113#return; 7481#L25-1 assume true; 7480#func_to_recursive_line_28_to_28_0EXIT >#119#return; 7437#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 7439#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 7449#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 7461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7462#L41-1 assume true; 7463#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7470#L41-1 assume true; 7500#func_to_recursive_line_27_to_28_0EXIT >#121#return; 7499#L41-1 assume true; 7498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 7474#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 7442#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7444#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 7464#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7467#L61-1 assume true; 7468#func_to_recursive_line_26_to_27_0EXIT >#127#return; 7469#L61-1 assume true; 7501#func_to_recursive_line_26_to_27_0EXIT >#115#return; 7472#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 7456#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 7473#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 7471#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7466#L81-1 assume true; 7453#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7460#L81-1 assume true; 7492#func_to_recursive_line_25_to_26_0EXIT >#117#return; 7487#L81-1 assume true; 7484#func_to_recursive_line_25_to_26_0EXIT >#123#return; 7483#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 7482#L114-2 assume !(main_~b~0#1 < 6); 7440#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 7441#L109-2 [2024-10-12 01:01:46,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:46,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times [2024-10-12 01:01:46,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:46,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77821056] [2024-10-12 01:01:46,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:46,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:46,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:46,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:46,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:46,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1571385713, now seen corresponding path program 4 times [2024-10-12 01:01:46,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:46,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884808567] [2024-10-12 01:01:46,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:46,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:49,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 01:01:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 01:01:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 01:01:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 01:01:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 01:01:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 01:01:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 01:01:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 01:01:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 01:01:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-10-12 01:01:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 01:01:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 01:01:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 01:01:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 01:01:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-10-12 01:01:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 01:01:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 01:01:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 01:01:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 01:01:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 622 [2024-10-12 01:01:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 01:01:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 01:01:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 01:01:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 01:01:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 777 [2024-10-12 01:01:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 01:01:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 01:01:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 01:01:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 01:01:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 26307 backedges. 21 proven. 1579 refuted. 0 times theorem prover too weak. 24707 trivial. 0 not checked. [2024-10-12 01:01:51,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:51,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884808567] [2024-10-12 01:01:51,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884808567] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:51,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945579549] [2024-10-12 01:01:51,991 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 01:01:51,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:51,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:51,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:01:51,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 01:01:52,812 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 01:01:52,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:01:52,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 6104 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 01:01:52,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:52,877 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-10-12 01:01:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 26307 backedges. 13143 proven. 3 refuted. 0 times theorem prover too weak. 13161 trivial. 0 not checked. [2024-10-12 01:01:53,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 26307 backedges. 183 proven. 126 refuted. 0 times theorem prover too weak. 25998 trivial. 0 not checked. [2024-10-12 01:01:54,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945579549] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:54,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:54,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 10] total 29 [2024-10-12 01:01:54,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593777874] [2024-10-12 01:01:54,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:54,693 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:54,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:54,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 01:01:54,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2024-10-12 01:01:54,694 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. cyclomatic complexity: 19 Second operand has 29 states, 23 states have (on average 3.217391304347826) internal successors, (74), 22 states have internal predecessors, (74), 10 states have call successors, (38), 9 states have call predecessors, (38), 10 states have return successors, (33), 9 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-12 01:01:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:55,110 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2024-10-12 01:01:55,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 83 transitions. [2024-10-12 01:01:55,111 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-12 01:01:55,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 83 transitions. [2024-10-12 01:01:55,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2024-10-12 01:01:55,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2024-10-12 01:01:55,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 83 transitions. [2024-10-12 01:01:55,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:55,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-10-12 01:01:55,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 83 transitions. [2024-10-12 01:01:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-12 01:01:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.119047619047619) internal successors, (47), 45 states have internal predecessors, (47), 13 states have call successors, (13), 4 states have call predecessors, (13), 14 states have return successors, (23), 19 states have call predecessors, (23), 13 states have call successors, (23) [2024-10-12 01:01:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2024-10-12 01:01:55,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-10-12 01:01:55,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 01:01:55,121 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-10-12 01:01:55,121 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 01:01:55,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 83 transitions. [2024-10-12 01:01:55,121 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-12 01:01:55,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:55,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:55,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:01:55,133 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [240, 240, 192, 192, 192, 72, 72, 48, 48, 48, 48, 48, 48, 48, 36, 36, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-12 01:01:55,133 INFO L745 eck$LassoCheckResult]: Stem: 17701#$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); 17672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 17666#L109-2 [2024-10-12 01:01:55,135 INFO L747 eck$LassoCheckResult]: Loop: 17666#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 17673#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17674#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17688#L81-1 assume true; 17675#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17682#L81-1 assume true; 17724#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17719#L81-1 assume true; 17717#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17697#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17698#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17680#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17688#L81-1 assume true; 17675#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17682#L81-1 assume true; 17724#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17719#L81-1 assume true; 17717#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17721#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17727#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17681#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17688#L81-1 assume true; 17675#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17682#L81-1 assume true; 17724#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17719#L81-1 assume true; 17717#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17722#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17726#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17676#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17688#L81-1 assume true; 17675#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17682#L81-1 assume true; 17724#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17719#L81-1 assume true; 17717#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17718#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17725#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17678#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17688#L81-1 assume true; 17675#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17682#L81-1 assume true; 17724#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17719#L81-1 assume true; 17717#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17720#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17723#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17679#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 17663#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17660#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 17669#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17668#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17667#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 17670#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17687#L25-1 assume true; 17699#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17700#L25-1 assume true; 17708#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17705#L25-1 assume true; 17704#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17703#L25-1 assume true; 17702#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17659#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17661#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17671#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17683#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17684#L41-1 assume true; 17685#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17692#L41-1 assume true; 17711#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17710#L41-1 assume true; 17709#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17696#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17662#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17664#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 17686#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17689#L61-1 assume true; 17690#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17691#L61-1 assume true; 17714#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17713#L61-1 assume true; 17712#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17694#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17677#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17695#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 17693#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17688#L81-1 assume true; 17675#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17682#L81-1 assume true; 17724#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17719#L81-1 assume true; 17717#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17716#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17715#L114-2 assume !(main_~b~0#1 < 6); 17665#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 17666#L109-2 [2024-10-12 01:01:55,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 10 times [2024-10-12 01:01:55,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:55,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722839746] [2024-10-12 01:01:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:55,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:55,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:55,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:55,150 INFO L85 PathProgramCache]: Analyzing trace with hash 131940145, now seen corresponding path program 5 times [2024-10-12 01:01:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:55,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775467537] [2024-10-12 01:01:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:03,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:04,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:04,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 01:02:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 01:02:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2024-10-12 01:02:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 01:02:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:05,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 01:02:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 644 [2024-10-12 01:02:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 01:02:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 01:02:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 965 [2024-10-12 01:02:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 01:02:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 01:02:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1286 [2024-10-12 01:02:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 01:02:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 01:02:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:07,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1607 [2024-10-12 01:02:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 01:02:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:02:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:02:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 01:02:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 150873 backedges. 29 proven. 4744 refuted. 0 times theorem prover too weak. 146100 trivial. 0 not checked. [2024-10-12 01:02:08,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:02:08,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775467537] [2024-10-12 01:02:08,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775467537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:02:08,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881468634] [2024-10-12 01:02:08,598 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 01:02:08,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:02:08,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:08,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:02:08,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 01:02:09,286 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-10-12 01:02:09,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:02:09,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-12 01:02:09,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:09,331 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-10-12 01:02:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 150873 backedges. 17453 proven. 24 refuted. 0 times theorem prover too weak. 133396 trivial. 0 not checked. [2024-10-12 01:02:09,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:02:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 150873 backedges. 269 proven. 5761 refuted. 0 times theorem prover too weak. 144843 trivial. 0 not checked. [2024-10-12 01:02:14,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881468634] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:02:14,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:02:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 22] total 41 [2024-10-12 01:02:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853148513] [2024-10-12 01:02:14,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:02:14,546 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:02:14,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:02:14,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-12 01:02:14,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1356, Unknown=0, NotChecked=0, Total=1640 [2024-10-12 01:02:14,547 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. cyclomatic complexity: 19 Second operand has 41 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 32 states have internal predecessors, (81), 12 states have call successors, (42), 11 states have call predecessors, (42), 13 states have return successors, (38), 11 states have call predecessors, (38), 12 states have call successors, (38) [2024-10-12 01:02:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:02:14,940 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2024-10-12 01:02:14,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 87 transitions. [2024-10-12 01:02:14,942 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-12 01:02:14,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 87 transitions. [2024-10-12 01:02:14,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2024-10-12 01:02:14,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2024-10-12 01:02:14,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 87 transitions. [2024-10-12 01:02:14,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:02:14,944 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-10-12 01:02:14,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 87 transitions. [2024-10-12 01:02:14,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-12 01:02:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 47 states have internal predecessors, (49), 13 states have call successors, (13), 4 states have call predecessors, (13), 16 states have return successors, (25), 21 states have call predecessors, (25), 13 states have call successors, (25) [2024-10-12 01:02:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2024-10-12 01:02:14,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-10-12 01:02:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 01:02:14,955 INFO L425 stractBuchiCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-10-12 01:02:14,955 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 01:02:14,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 87 transitions. [2024-10-12 01:02:14,956 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-12 01:02:14,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:02:14,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:02:14,961 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:02:14,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [336, 336, 288, 288, 288, 72, 72, 48, 48, 48, 48, 48, 48, 48, 36, 36, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-12 01:02:14,962 INFO L745 eck$LassoCheckResult]: Stem: 41021#$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); 40994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 40983#L109-2 [2024-10-12 01:02:14,963 INFO L747 eck$LassoCheckResult]: Loop: 40983#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 40992#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 40993#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 41008#L81-1 assume true; 40995#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41002#L81-1 assume true; 41034#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41030#L81-1 assume true; 41026#func_to_recursive_line_25_to_26_0EXIT >#123#return; 41017#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 41018#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 40996#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 41008#L81-1 assume true; 40995#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41002#L81-1 assume true; 41034#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41030#L81-1 assume true; 41026#func_to_recursive_line_25_to_26_0EXIT >#123#return; 41027#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 41045#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 40997#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 41008#L81-1 assume true; 40995#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41002#L81-1 assume true; 41034#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41030#L81-1 assume true; 41026#func_to_recursive_line_25_to_26_0EXIT >#123#return; 41028#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 41042#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 40998#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 41008#L81-1 assume true; 40995#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41002#L81-1 assume true; 41034#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41030#L81-1 assume true; 41026#func_to_recursive_line_25_to_26_0EXIT >#123#return; 41029#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 41038#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 41000#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 41008#L81-1 assume true; 40995#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41002#L81-1 assume true; 41034#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41030#L81-1 assume true; 41026#func_to_recursive_line_25_to_26_0EXIT >#123#return; 41031#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 41033#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 41001#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 40985#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 40981#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 40989#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 40988#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 40987#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 40990#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 41007#L25-1 assume true; 41019#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41020#L25-1 assume true; 41044#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41043#L25-1 assume true; 41041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41040#L25-1 assume true; 41039#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41037#L25-1 assume true; 41036#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41035#L25-1 assume true; 41032#func_to_recursive_line_28_to_28_0EXIT >#113#return; 41023#L25-1 assume true; 41022#func_to_recursive_line_28_to_28_0EXIT >#119#return; 40979#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 40980#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 40991#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 41003#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 41004#L41-1 assume true; 41005#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41012#L41-1 assume true; 41048#func_to_recursive_line_27_to_28_0EXIT >#121#return; 41047#L41-1 assume true; 41046#func_to_recursive_line_27_to_28_0EXIT >#125#return; 41016#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 40984#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 40986#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 41006#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 41009#L61-1 assume true; 41010#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41011#L61-1 assume true; 41051#func_to_recursive_line_26_to_27_0EXIT >#127#return; 41050#L61-1 assume true; 41049#func_to_recursive_line_26_to_27_0EXIT >#115#return; 41014#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 40999#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 41015#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 41013#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 41008#L81-1 assume true; 40995#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41002#L81-1 assume true; 41034#func_to_recursive_line_25_to_26_0EXIT >#117#return; 41030#L81-1 assume true; 41026#func_to_recursive_line_25_to_26_0EXIT >#123#return; 41025#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 41024#L114-2 assume !(main_~b~0#1 < 6); 40982#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 40983#L109-2 [2024-10-12 01:02:14,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:14,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 11 times [2024-10-12 01:02:14,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:14,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105663097] [2024-10-12 01:02:14,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:14,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:14,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:14,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:14,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:14,983 INFO L85 PathProgramCache]: Analyzing trace with hash -569602255, now seen corresponding path program 6 times [2024-10-12 01:02:14,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:14,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116089229] [2024-10-12 01:02:14,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:14,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:22,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 01:02:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 01:02:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2024-10-12 01:02:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:23,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 01:02:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 01:02:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 804 [2024-10-12 01:02:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 01:02:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:24,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 01:02:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1205 [2024-10-12 01:02:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 01:02:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 01:02:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1606 [2024-10-12 01:02:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 01:02:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 01:02:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2007 [2024-10-12 01:02:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 01:02:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:02:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 01:02:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 284265 backedges. 23 proven. 1092 refuted. 0 times theorem prover too weak. 283150 trivial. 0 not checked. [2024-10-12 01:02:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:02:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116089229] [2024-10-12 01:02:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116089229] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:02:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858057111] [2024-10-12 01:02:27,800 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 01:02:27,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:02:27,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:27,802 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:02:27,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 01:02:28,789 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-12 01:02:28,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:02:28,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-12 01:02:28,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:28,857 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-10-12 01:02:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 284265 backedges. 256 proven. 8 refuted. 0 times theorem prover too weak. 284001 trivial. 0 not checked. [2024-10-12 01:02:29,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:02:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 284265 backedges. 256 proven. 15 refuted. 0 times theorem prover too weak. 283994 trivial. 0 not checked. [2024-10-12 01:02:34,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858057111] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:02:34,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:02:34,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 14] total 35 [2024-10-12 01:02:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223733432] [2024-10-12 01:02:34,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:02:34,283 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:02:34,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:02:34,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 01:02:34,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 01:02:34,284 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. cyclomatic complexity: 19 Second operand has 35 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 15 states have call successors, (32), 9 states have call predecessors, (32), 11 states have return successors, (27), 13 states have call predecessors, (27), 15 states have call successors, (27) [2024-10-12 01:02:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:02:34,808 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2024-10-12 01:02:34,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 91 transitions. [2024-10-12 01:02:34,810 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-12 01:02:34,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 91 transitions. [2024-10-12 01:02:34,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2024-10-12 01:02:34,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2024-10-12 01:02:34,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 91 transitions. [2024-10-12 01:02:34,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:02:34,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-10-12 01:02:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 91 transitions. [2024-10-12 01:02:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-12 01:02:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.108695652173913) internal successors, (51), 49 states have internal predecessors, (51), 13 states have call successors, (13), 4 states have call predecessors, (13), 18 states have return successors, (27), 23 states have call predecessors, (27), 13 states have call successors, (27) [2024-10-12 01:02:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2024-10-12 01:02:34,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-10-12 01:02:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 01:02:34,818 INFO L425 stractBuchiCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-10-12 01:02:34,818 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 01:02:34,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 91 transitions. [2024-10-12 01:02:34,818 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-12 01:02:34,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:02:34,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:02:34,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 01:02:34,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [756, 756, 648, 648, 648, 144, 144, 108, 108, 108, 108, 108, 108, 108, 54, 54, 36, 36, 36, 36, 36, 36, 36, 24, 24, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-12 01:02:34,827 INFO L745 eck$LassoCheckResult]: Stem: 72414#$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); 72386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 72378#L109-2 [2024-10-12 01:02:34,830 INFO L747 eck$LassoCheckResult]: Loop: 72378#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 72384#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 72385#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 72401#L81-1 assume true; 72387#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72394#L81-1 assume true; 72441#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72439#L81-1 assume true; 72438#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72435#L81-1 assume true; 72431#func_to_recursive_line_25_to_26_0EXIT >#123#return; 72410#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 72411#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 72388#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 72401#L81-1 assume true; 72387#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72394#L81-1 assume true; 72441#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72439#L81-1 assume true; 72438#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72435#L81-1 assume true; 72431#func_to_recursive_line_25_to_26_0EXIT >#123#return; 72432#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 72445#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 72389#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 72401#L81-1 assume true; 72387#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72394#L81-1 assume true; 72441#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72439#L81-1 assume true; 72438#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72435#L81-1 assume true; 72431#func_to_recursive_line_25_to_26_0EXIT >#123#return; 72433#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 72442#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 72390#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 72401#L81-1 assume true; 72387#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72394#L81-1 assume true; 72441#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72439#L81-1 assume true; 72438#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72435#L81-1 assume true; 72431#func_to_recursive_line_25_to_26_0EXIT >#123#return; 72434#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 72440#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 72392#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 72401#L81-1 assume true; 72387#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72394#L81-1 assume true; 72441#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72439#L81-1 assume true; 72438#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72435#L81-1 assume true; 72431#func_to_recursive_line_25_to_26_0EXIT >#123#return; 72436#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 72437#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 72393#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~d.base, ~d.offset, 4); 72375#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 72372#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 72381#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 72380#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 72379#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 72382#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 72400#L25-1 assume true; 72412#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72413#L25-1 assume true; 72447#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72446#L25-1 assume true; 72444#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72443#L25-1 assume true; 72430#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72428#L25-1 assume true; 72426#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72425#L25-1 assume true; 72424#func_to_recursive_line_28_to_28_0EXIT >#113#return; 72417#L25-1 assume true; 72416#func_to_recursive_line_28_to_28_0EXIT >#119#return; 72371#L47-1 call #t~mem8 := read~int#3(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 72373#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 72383#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 72395#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 72396#L41-1 assume true; 72405#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72397#L41-1 assume true; 72398#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72423#L41-1 assume true; 72422#func_to_recursive_line_27_to_28_0EXIT >#121#return; 72419#L41-1 assume true; 72418#func_to_recursive_line_27_to_28_0EXIT >#125#return; 72409#L67-1 call #t~mem11 := read~int#2(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 72374#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72376#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#2(~d.base, ~d.offset, 4); 72399#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 72402#L61-1 assume true; 72403#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72404#L61-1 assume true; 72415#func_to_recursive_line_26_to_27_0EXIT >#127#return; 72421#L61-1 assume true; 72420#func_to_recursive_line_26_to_27_0EXIT >#115#return; 72407#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 72391#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 72408#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 72406#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 72401#L81-1 assume true; 72387#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72394#L81-1 assume true; 72441#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72439#L81-1 assume true; 72438#func_to_recursive_line_25_to_26_0EXIT >#117#return; 72435#L81-1 assume true; 72431#func_to_recursive_line_25_to_26_0EXIT >#123#return; 72429#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 72427#L114-2 assume !(main_~b~0#1 < 6); 72377#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 72378#L109-2 [2024-10-12 01:02:34,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 12 times [2024-10-12 01:02:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738793182] [2024-10-12 01:02:34,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:34,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:34,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:34,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash 736790991, now seen corresponding path program 7 times [2024-10-12 01:02:34,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:34,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202118798] [2024-10-12 01:02:34,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:34,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:54,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 01:02:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:58,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 01:02:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-12 01:02:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 01:02:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 01:02:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-12 01:02:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 01:02:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:59,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:03:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:03:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:03:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 01:03:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-12 01:03:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 846 [2024-10-12 01:03:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:03:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:03:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:03:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 01:03:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:03:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:03:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:03:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 01:03:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-12 01:03:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:03:00,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:03:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat