./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml', '-i', '../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(F end) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-08 00:34:13,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 00:34:13,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-08 00:34:13,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 00:34:13,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 00:34:13,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 00:34:13,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 00:34:13,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 00:34:13,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 00:34:13,423 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 00:34:13,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 00:34:13,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 00:34:13,425 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 00:34:13,425 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-08 00:34:13,425 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-08 00:34:13,425 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-08 00:34:13,425 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-08 00:34:13,426 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-08 00:34:13,426 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-08 00:34:13,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 00:34:13,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-08 00:34:13,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 00:34:13,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 00:34:13,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 00:34:13,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 00:34:13,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-08 00:34:13,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-08 00:34:13,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-08 00:34:13,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 00:34:13,427 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 00:34:13,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 00:34:13,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 00:34:13,427 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-08 00:34:13,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 00:34:13,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 00:34:13,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 00:34:13,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 00:34:13,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 00:34:13,427 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-08 00:34:13,427 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c [2024-11-08 00:34:13,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 00:34:13,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 00:34:13,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 00:34:13,699 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 00:34:13,699 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 00:34:13,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-11-08 00:34:14,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 00:34:15,182 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 00:34:15,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-11-08 00:34:15,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e28f93192/d5d4a69ff44541078b35404cabd9258e/FLAG742a66c2d [2024-11-08 00:34:15,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e28f93192/d5d4a69ff44541078b35404cabd9258e [2024-11-08 00:34:15,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 00:34:15,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 00:34:15,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 00:34:15,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 00:34:15,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 00:34:15,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702201dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15, skipping insertion in model container [2024-11-08 00:34:15,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 00:34:15,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 00:34:15,399 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 00:34:15,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 00:34:15,435 INFO L204 MainTranslator]: Completed translation [2024-11-08 00:34:15,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15 WrapperNode [2024-11-08 00:34:15,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 00:34:15,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 00:34:15,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 00:34:15,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 00:34:15,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,476 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-11-08 00:34:15,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 00:34:15,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 00:34:15,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 00:34:15,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 00:34:15,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,511 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2024-11-08 00:34:15,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 00:34:15,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 00:34:15,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 00:34:15,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 00:34:15,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:34:15,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:15,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:34:15,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-08 00:34:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 00:34:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2024-11-08 00:34:15,603 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2024-11-08 00:34:15,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 00:34:15,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 00:34:15,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 00:34:15,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 00:34:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 00:34:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 00:34:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 00:34:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 00:34:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 00:34:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 00:34:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 00:34:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-08 00:34:15,604 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-08 00:34:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2024-11-08 00:34:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2024-11-08 00:34:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 00:34:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 00:34:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 00:34:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 00:34:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 00:34:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 00:34:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 00:34:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-08 00:34:15,606 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-08 00:34:15,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 00:34:15,717 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 00:34:15,720 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 00:34:15,942 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-08 00:34:15,942 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 00:34:15,952 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 00:34:15,953 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 00:34:15,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:34:15 BoogieIcfgContainer [2024-11-08 00:34:15,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 00:34:15,955 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-08 00:34:15,955 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-08 00:34:15,959 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-08 00:34:15,959 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:34:15,959 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 12:34:15" (1/3) ... [2024-11-08 00:34:15,960 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c196fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:34:15, skipping insertion in model container [2024-11-08 00:34:15,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:34:15,960 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (2/3) ... [2024-11-08 00:34:15,961 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c196fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:34:15, skipping insertion in model container [2024-11-08 00:34:15,961 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:34:15,961 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:34:15" (3/3) ... [2024-11-08 00:34:15,962 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2024-11-08 00:34:16,001 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-08 00:34:16,002 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-08 00:34:16,002 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-08 00:34:16,002 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-08 00:34:16,002 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-08 00:34:16,002 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-08 00:34:16,003 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-08 00:34:16,003 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-08 00:34:16,007 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-11-08 00:34:16,022 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:16,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:16,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:16,027 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:34:16,028 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-08 00:34:16,028 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-08 00:34:16,028 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-11-08 00:34:16,031 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:16,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:16,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:16,031 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:34:16,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-08 00:34:16,038 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 34#L109-2true [2024-11-08 00:34:16,038 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-11-08 00:34:16,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:16,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2024-11-08 00:34:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812722290] [2024-11-08 00:34:16,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:16,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:16,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:16,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:16,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash 71729, now seen corresponding path program 1 times [2024-11-08 00:34:16,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:16,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274453165] [2024-11-08 00:34:16,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:16,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:34:16,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:16,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274453165] [2024-11-08 00:34:16,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274453165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:34:16,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:34:16,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 00:34:16,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089912796] [2024-11-08 00:34:16,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:34:16,254 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:16,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:16,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 00:34:16,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 00:34:16,279 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-11-08 00:34:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:16,312 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-11-08 00:34:16,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2024-11-08 00:34:16,317 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2024-11-08 00:34:16,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 36 states and 46 transitions. [2024-11-08 00:34:16,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-08 00:34:16,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-08 00:34:16,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2024-11-08 00:34:16,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:16,327 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-08 00:34:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2024-11-08 00:34:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-08 00:34:16,350 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-11-08 00:34:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-08 00:34:16,355 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-08 00:34:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 00:34:16,358 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-08 00:34:16,358 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-08 00:34:16,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2024-11-08 00:34:16,360 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-08 00:34:16,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:16,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:16,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:34:16,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:34:16,361 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 109#L109-2 [2024-11-08 00:34:16,362 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#2(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#2(~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-11-08 00:34:16,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2024-11-08 00:34:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:16,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431129812] [2024-11-08 00:34:16,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:16,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:16,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:16,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:16,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1371427203, now seen corresponding path program 1 times [2024-11-08 00:34:16,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:16,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572775063] [2024-11-08 00:34:16,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:16,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:16,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 00:34:16,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:16,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572775063] [2024-11-08 00:34:16,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572775063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:34:16,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:34:16,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 00:34:16,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194597835] [2024-11-08 00:34:16,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:34:16,716 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:16,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:16,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 00:34:16,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 00:34:16,720 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-11-08 00:34:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:16,963 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-11-08 00:34:16,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2024-11-08 00:34:16,965 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-08 00:34:16,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 54 transitions. [2024-11-08 00:34:16,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-08 00:34:16,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-08 00:34:16,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2024-11-08 00:34:16,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:16,968 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-11-08 00:34:16,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2024-11-08 00:34:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-08 00:34:16,971 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-11-08 00:34:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-08 00:34:16,972 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-08 00:34:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 00:34:16,973 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-08 00:34:16,973 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-08 00:34:16,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2024-11-08 00:34:16,975 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-08 00:34:16,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:16,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:16,975 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:34:16,975 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-11-08 00:34:16,975 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 205#L109-2 [2024-11-08 00:34:16,976 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#2(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#2(~c.base, ~c.offset, 4); 227#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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-11-08 00:34:16,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:16,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times [2024-11-08 00:34:16,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:16,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178805872] [2024-11-08 00:34:16,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:16,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:16,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:17,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:17,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:17,006 INFO L85 PathProgramCache]: Analyzing trace with hash 182328154, now seen corresponding path program 1 times [2024-11-08 00:34:17,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:17,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92054923] [2024-11-08 00:34:17,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:17,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 00:34:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 00:34:17,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:17,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92054923] [2024-11-08 00:34:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92054923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:34:17,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:34:17,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 00:34:17,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350559745] [2024-11-08 00:34:17,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:34:17,406 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:17,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:17,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 00:34:17,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 00:34:17,407 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-11-08 00:34:17,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:17,594 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-11-08 00:34:17,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2024-11-08 00:34:17,595 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-08 00:34:17,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 53 transitions. [2024-11-08 00:34:17,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-08 00:34:17,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-08 00:34:17,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-08 00:34:17,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:17,600 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-08 00:34:17,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-08 00:34:17,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-08 00:34:17,603 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-11-08 00:34:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-08 00:34:17,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-08 00:34:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 00:34:17,606 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-08 00:34:17,606 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-08 00:34:17,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2024-11-08 00:34:17,607 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-08 00:34:17,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:17,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:17,608 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:34:17,608 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-11-08 00:34:17,608 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 320#L109-2 [2024-11-08 00:34:17,609 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#2(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#2(~c.base, ~c.offset, 4); 342#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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-11-08 00:34:17,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:17,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times [2024-11-08 00:34:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:17,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779491050] [2024-11-08 00:34:17,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:17,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:17,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:17,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:17,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:17,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2098832724, now seen corresponding path program 1 times [2024-11-08 00:34:17,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:17,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024702901] [2024-11-08 00:34:17,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:17,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 00:34:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 00:34:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 00:34:18,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024702901] [2024-11-08 00:34:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024702901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:34:18,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:34:18,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 00:34:18,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850451373] [2024-11-08 00:34:18,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:34:18,085 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:18,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 00:34:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 00:34:18,086 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-11-08 00:34:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:18,253 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-08 00:34:18,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-11-08 00:34:18,254 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-08 00:34:18,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-11-08 00:34:18,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-08 00:34:18,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-08 00:34:18,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-11-08 00:34:18,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:18,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-08 00:34:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-11-08 00:34:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-08 00:34:18,262 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-11-08 00:34:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-11-08 00:34:18,264 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-08 00:34:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 00:34:18,266 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-08 00:34:18,266 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-08 00:34:18,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-11-08 00:34:18,267 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-08 00:34:18,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:18,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:18,268 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:34:18,268 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-11-08 00:34:18,268 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 468#L109-2 [2024-11-08 00:34:18,268 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#2(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#2(~c.base, ~c.offset, 4); 490#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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-11-08 00:34:18,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times [2024-11-08 00:34:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:18,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355916205] [2024-11-08 00:34:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:18,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:18,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:18,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash 500602406, now seen corresponding path program 1 times [2024-11-08 00:34:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:18,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713690310] [2024-11-08 00:34:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 00:34:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 00:34:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 00:34:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 00:34:18,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:18,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713690310] [2024-11-08 00:34:18,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713690310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:34:18,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:34:18,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 00:34:18,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543541550] [2024-11-08 00:34:18,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:34:18,783 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:18,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:18,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 00:34:18,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 00:34:18,784 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-11-08 00:34:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:18,962 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-08 00:34:18,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-11-08 00:34:18,963 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-08 00:34:18,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-11-08 00:34:18,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-08 00:34:18,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-08 00:34:18,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-11-08 00:34:18,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:18,965 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-08 00:34:18,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-11-08 00:34:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-08 00:34:18,969 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-11-08 00:34:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-11-08 00:34:18,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-08 00:34:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 00:34:18,973 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-08 00:34:18,973 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-08 00:34:18,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2024-11-08 00:34:18,974 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-08 00:34:18,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:18,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:18,975 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:34:18,975 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-11-08 00:34:18,975 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 660#L109-2 [2024-11-08 00:34:18,975 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#2(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#2(~c.base, ~c.offset, 4); 682#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 664#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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-11-08 00:34:18,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times [2024-11-08 00:34:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:18,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111848322] [2024-11-08 00:34:18,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:18,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:18,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:18,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1994055486, now seen corresponding path program 1 times [2024-11-08 00:34:18,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:18,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474344055] [2024-11-08 00:34:18,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:18,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 00:34:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 00:34:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 00:34:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 00:34:19,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:19,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474344055] [2024-11-08 00:34:19,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474344055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:19,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447569839] [2024-11-08 00:34:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:19,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:19,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:19,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:34:19,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 00:34:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:20,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 00:34:20,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 00:34:20,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 00:34:20,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447569839] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:20,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:20,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 16 [2024-11-08 00:34:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468276195] [2024-11-08 00:34:20,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:20,239 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:20,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:20,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 00:34:20,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-08 00:34:20,239 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-11-08 00:34:20,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:20,579 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-11-08 00:34:20,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2024-11-08 00:34:20,580 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-11-08 00:34:20,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 65 transitions. [2024-11-08 00:34:20,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-11-08 00:34:20,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-11-08 00:34:20,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 65 transitions. [2024-11-08 00:34:20,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:20,582 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-11-08 00:34:20,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 65 transitions. [2024-11-08 00:34:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-08 00:34:20,586 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-11-08 00:34:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2024-11-08 00:34:20,589 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-11-08 00:34:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 00:34:20,590 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-11-08 00:34:20,590 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-08 00:34:20,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 65 transitions. [2024-11-08 00:34:20,591 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-11-08 00:34:20,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:20,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:20,597 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:34:20,597 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-11-08 00:34:20,597 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 1180#L109-2 [2024-11-08 00:34:20,598 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#2(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#2(~c.base, ~c.offset, 4); 1205#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 1205#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 1205#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 1205#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 1184#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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-11-08 00:34:20,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times [2024-11-08 00:34:20,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:20,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766887431] [2024-11-08 00:34:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:20,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:20,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:20,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:20,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash -607354947, now seen corresponding path program 2 times [2024-11-08 00:34:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568363157] [2024-11-08 00:34:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:20,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 00:34:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 00:34:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 00:34:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 00:34:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 00:34:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 00:34:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 00:34:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 00:34:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 00:34:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 00:34:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 00:34:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 45 proven. 59 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-08 00:34:22,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:22,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568363157] [2024-11-08 00:34:22,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568363157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:22,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739694803] [2024-11-08 00:34:22,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 00:34:22,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:22,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:22,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:34:22,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 00:34:22,501 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 00:34:22,501 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:22,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 00:34:22,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2024-11-08 00:34:22,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2024-11-08 00:34:23,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739694803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:23,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:23,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2024-11-08 00:34:23,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784531312] [2024-11-08 00:34:23,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:23,124 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:23,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:23,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 00:34:23,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-08 00:34:23,125 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-11-08 00:34:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:23,496 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2024-11-08 00:34:23,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 75 transitions. [2024-11-08 00:34:23,498 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-08 00:34:23,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 75 transitions. [2024-11-08 00:34:23,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2024-11-08 00:34:23,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2024-11-08 00:34:23,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 75 transitions. [2024-11-08 00:34:23,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:23,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-11-08 00:34:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 75 transitions. [2024-11-08 00:34:23,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-08 00:34:23,508 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-11-08 00:34:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2024-11-08 00:34:23,509 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-11-08 00:34:23,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 00:34:23,510 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-11-08 00:34:23,510 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-08 00:34:23,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 75 transitions. [2024-11-08 00:34:23,511 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-08 00:34:23,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:23,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:23,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:34:23,522 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-11-08 00:34:23,522 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 3123#L109-2 [2024-11-08 00:34:23,523 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#2(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#2(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 3150#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 3127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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-11-08 00:34:23,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times [2024-11-08 00:34:23,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:23,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436061180] [2024-11-08 00:34:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:23,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:23,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:23,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:23,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:23,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1998520751, now seen corresponding path program 3 times [2024-11-08 00:34:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:23,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66268094] [2024-11-08 00:34:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:25,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:25,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:25,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:25,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:25,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 00:34:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 00:34:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 00:34:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 00:34:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 00:34:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 00:34:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 00:34:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 00:34:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 00:34:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 00:34:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 00:34:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-08 00:34:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 00:34:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 00:34:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-08 00:34:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 00:34:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 00:34:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4275 backedges. 21 proven. 472 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2024-11-08 00:34:26,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:26,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66268094] [2024-11-08 00:34:26,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66268094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:26,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463404122] [2024-11-08 00:34:26,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 00:34:26,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:26,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:26,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:34:26,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 00:34:26,970 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-08 00:34:26,970 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:26,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 00:34:26,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:27,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 00:34:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4275 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 4161 trivial. 0 not checked. [2024-11-08 00:34:27,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4275 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2024-11-08 00:34:28,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463404122] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:28,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:28,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10] total 30 [2024-11-08 00:34:28,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954000016] [2024-11-08 00:34:28,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:28,428 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:28,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:28,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 00:34:28,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2024-11-08 00:34:28,429 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, (24), 8 states have call predecessors, (24), 11 states have call successors, (24) [2024-11-08 00:34:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:29,012 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2024-11-08 00:34:29,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 79 transitions. [2024-11-08 00:34:29,013 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-08 00:34:29,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 79 transitions. [2024-11-08 00:34:29,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2024-11-08 00:34:29,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2024-11-08 00:34:29,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 79 transitions. [2024-11-08 00:34:29,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:29,017 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-11-08 00:34:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 79 transitions. [2024-11-08 00:34:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-08 00:34:29,023 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-11-08 00:34:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2024-11-08 00:34:29,025 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-11-08 00:34:29,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 00:34:29,026 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-11-08 00:34:29,026 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-08 00:34:29,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 79 transitions. [2024-11-08 00:34:29,027 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-08 00:34:29,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:29,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:29,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:34:29,033 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-11-08 00:34:29,033 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 7441#L109-2 [2024-11-08 00:34:29,034 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#2(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#2(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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#2(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#2(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~c.base, ~c.offset, 4); 7471#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(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#4(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~f.base, ~f.offset, 4); 7448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(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#1(~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#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#4(~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#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 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#2(~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-11-08 00:34:29,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times [2024-11-08 00:34:29,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:29,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109176464] [2024-11-08 00:34:29,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:29,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:29,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:29,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1571385713, now seen corresponding path program 4 times [2024-11-08 00:34:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:29,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839861594] [2024-11-08 00:34:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:32,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 00:34:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 00:34:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 00:34:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 00:34:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 00:34:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 00:34:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 00:34:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 00:34:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 00:34:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-11-08 00:34:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 00:34:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 00:34:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 00:34:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 00:34:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-11-08 00:34:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 00:34:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 00:34:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 00:34:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 00:34:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 622 [2024-11-08 00:34:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 00:34:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 00:34:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 00:34:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 00:34:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 777 [2024-11-08 00:34:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 00:34:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 00:34:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 00:34:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 00:34:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 26307 backedges. 25 proven. 1579 refuted. 0 times theorem prover too weak. 24703 trivial. 0 not checked. [2024-11-08 00:34:35,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:35,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839861594] [2024-11-08 00:34:35,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839861594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:35,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340126013] [2024-11-08 00:34:35,449 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 00:34:35,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:35,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:35,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:34:35,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 00:34:36,496 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 00:34:36,497 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:36,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 6104 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 00:34:36,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:36,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 00:34:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 26307 backedges. 12048 proven. 8 refuted. 0 times theorem prover too weak. 14251 trivial. 0 not checked. [2024-11-08 00:34:36,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 26307 backedges. 176 proven. 111 refuted. 0 times theorem prover too weak. 26020 trivial. 0 not checked. [2024-11-08 00:34:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340126013] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:38,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:38,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 14] total 36 [2024-11-08 00:34:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139096095] [2024-11-08 00:34:38,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:38,990 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:38,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:38,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-08 00:34:38,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1103, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 00:34:38,992 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. cyclomatic complexity: 19 Second operand has 36 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 13 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 12 states have call predecessors, (36), 13 states have call successors, (36) [2024-11-08 00:34:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:39,639 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2024-11-08 00:34:39,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 83 transitions. [2024-11-08 00:34:39,640 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-08 00:34:39,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 83 transitions. [2024-11-08 00:34:39,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2024-11-08 00:34:39,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2024-11-08 00:34:39,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 83 transitions. [2024-11-08 00:34:39,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:39,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-11-08 00:34:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 83 transitions. [2024-11-08 00:34:39,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 00:34:39,648 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-11-08 00:34:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2024-11-08 00:34:39,648 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-11-08 00:34:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 00:34:39,650 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-11-08 00:34:39,650 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-08 00:34:39,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 83 transitions. [2024-11-08 00:34:39,651 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-08 00:34:39,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:39,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:39,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:34:39,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [180, 180, 144, 144, 144, 54, 54, 36, 36, 36, 36, 36, 36, 36, 36, 36, 24, 24, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-08 00:34:39,657 INFO L745 eck$LassoCheckResult]: Stem: 17708#$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); 17681#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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 17670#L109-2 [2024-11-08 00:34:39,658 INFO L747 eck$LassoCheckResult]: Loop: 17670#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 17679#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17695#L81-1 assume true; 17682#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17689#L81-1 assume true; 17725#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17723#L81-1 assume true; 17721#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17716#L81-1 assume true; 17713#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17704#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; 17705#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17683#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17695#L81-1 assume true; 17682#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17689#L81-1 assume true; 17725#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17723#L81-1 assume true; 17721#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17716#L81-1 assume true; 17713#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17714#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; 17730#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17684#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17695#L81-1 assume true; 17682#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17689#L81-1 assume true; 17725#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17723#L81-1 assume true; 17721#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17716#L81-1 assume true; 17713#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17715#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; 17729#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17686#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17695#L81-1 assume true; 17682#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17689#L81-1 assume true; 17725#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17723#L81-1 assume true; 17721#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17716#L81-1 assume true; 17713#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17717#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#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17687#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17695#L81-1 assume true; 17682#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17689#L81-1 assume true; 17725#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17723#L81-1 assume true; 17721#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17716#L81-1 assume true; 17713#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; 17720#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17688#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17672#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 17667#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 17675#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17676#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17674#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 17677#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17694#L25-1 assume true; 17706#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17707#L25-1 assume true; 17728#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17726#L25-1 assume true; 17724#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17722#L25-1 assume true; 17719#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17710#L25-1 assume true; 17709#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17666#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; 17668#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17678#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 17690#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17691#L41-1 assume true; 17692#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17699#L41-1 assume true; 17733#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17732#L41-1 assume true; 17731#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17703#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17671#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17673#$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#4(~d.base, ~d.offset, 4); 17693#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17696#L61-1 assume true; 17697#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17698#L61-1 assume true; 17734#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17701#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17685#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);< 17702#$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#2(~c.base, ~c.offset, 4); 17700#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17695#L81-1 assume true; 17682#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17689#L81-1 assume true; 17725#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17723#L81-1 assume true; 17721#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17716#L81-1 assume true; 17713#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17712#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; 17711#L114-2 assume !(main_~b~0#1 < 6); 17669#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; 17670#L109-2 [2024-11-08 00:34:39,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:39,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 10 times [2024-11-08 00:34:39,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:39,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61877124] [2024-11-08 00:34:39,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:39,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:39,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:39,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:39,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1581159151, now seen corresponding path program 5 times [2024-11-08 00:34:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:39,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017187610] [2024-11-08 00:34:39,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:39,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:47,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:47,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-08 00:34:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:48,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 520 [2024-11-08 00:34:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 779 [2024-11-08 00:34:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1038 [2024-11-08 00:34:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1297 [2024-11-08 00:34:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 86943 backedges. 29 proven. 3592 refuted. 0 times theorem prover too weak. 83322 trivial. 0 not checked. [2024-11-08 00:34:50,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:50,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017187610] [2024-11-08 00:34:50,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017187610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:50,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136422087] [2024-11-08 00:34:50,742 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 00:34:50,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:50,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:50,744 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:34:50,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 00:34:51,527 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-08 00:34:51,527 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:51,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-08 00:34:51,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:51,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 00:34:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 86943 backedges. 13224 proven. 24 refuted. 0 times theorem prover too weak. 73695 trivial. 0 not checked. [2024-11-08 00:34:51,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 86943 backedges. 277 proven. 4277 refuted. 0 times theorem prover too weak. 82389 trivial. 0 not checked. [2024-11-08 00:34:56,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136422087] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:56,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:56,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 22] total 40 [2024-11-08 00:34:56,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758451559] [2024-11-08 00:34:56,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:56,911 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:56,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:56,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-08 00:34:56,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1280, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 00:34:56,913 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. cyclomatic complexity: 19 Second operand has 40 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 31 states have internal predecessors, (80), 11 states have call successors, (41), 11 states have call predecessors, (41), 13 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2024-11-08 00:34:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:57,394 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2024-11-08 00:34:57,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 87 transitions. [2024-11-08 00:34:57,395 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-08 00:34:57,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 87 transitions. [2024-11-08 00:34:57,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2024-11-08 00:34:57,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2024-11-08 00:34:57,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 87 transitions. [2024-11-08 00:34:57,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:57,402 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-11-08 00:34:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 87 transitions. [2024-11-08 00:34:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-08 00:34:57,409 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-11-08 00:34:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2024-11-08 00:34:57,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-11-08 00:34:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 00:34:57,411 INFO L425 stractBuchiCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-11-08 00:34:57,411 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-08 00:34:57,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 87 transitions. [2024-11-08 00:34:57,412 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-08 00:34:57,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:57,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:57,426 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:34:57,426 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [252, 252, 216, 216, 216, 54, 54, 36, 36, 36, 36, 36, 36, 36, 36, 36, 24, 24, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-08 00:34:57,426 INFO L745 eck$LassoCheckResult]: Stem: 36233#$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); 36204#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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 36198#L109-2 [2024-11-08 00:34:57,428 INFO L747 eck$LassoCheckResult]: Loop: 36198#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 36205#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 36206#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 36220#L81-1 assume true; 36207#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36214#L81-1 assume true; 36260#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36259#L81-1 assume true; 36258#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36254#L81-1 assume true; 36251#func_to_recursive_line_25_to_26_0EXIT >#123#return; 36229#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; 36230#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 36213#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 36220#L81-1 assume true; 36207#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36214#L81-1 assume true; 36260#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36259#L81-1 assume true; 36258#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36254#L81-1 assume true; 36251#func_to_recursive_line_25_to_26_0EXIT >#123#return; 36256#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; 36263#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 36208#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 36220#L81-1 assume true; 36207#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36214#L81-1 assume true; 36260#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36259#L81-1 assume true; 36258#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36254#L81-1 assume true; 36251#func_to_recursive_line_25_to_26_0EXIT >#123#return; 36252#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; 36262#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 36209#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 36220#L81-1 assume true; 36207#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36214#L81-1 assume true; 36260#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36259#L81-1 assume true; 36258#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36254#L81-1 assume true; 36251#func_to_recursive_line_25_to_26_0EXIT >#123#return; 36253#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; 36261#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 36211#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 36220#L81-1 assume true; 36207#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36214#L81-1 assume true; 36260#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36259#L81-1 assume true; 36258#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36254#L81-1 assume true; 36251#func_to_recursive_line_25_to_26_0EXIT >#123#return; 36255#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; 36257#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 36212#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 36195#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 36193#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 36201#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 36200#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 36199#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 36202#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36219#L25-1 assume true; 36231#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36232#L25-1 assume true; 36247#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36246#L25-1 assume true; 36245#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36242#L25-1 assume true; 36241#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36240#L25-1 assume true; 36239#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36238#L25-1 assume true; 36237#func_to_recursive_line_28_to_28_0EXIT >#113#return; 36236#L25-1 assume true; 36235#func_to_recursive_line_28_to_28_0EXIT >#119#return; 36191#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; 36192#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 36203#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 36215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36216#L41-1 assume true; 36217#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36224#L41-1 assume true; 36248#func_to_recursive_line_27_to_28_0EXIT >#121#return; 36244#L41-1 assume true; 36243#func_to_recursive_line_27_to_28_0EXIT >#125#return; 36228#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 36194#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 36196#$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#4(~d.base, ~d.offset, 4); 36218#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36221#L61-1 assume true; 36222#func_to_recursive_line_26_to_27_0EXIT >#127#return; 36223#L61-1 assume true; 36234#func_to_recursive_line_26_to_27_0EXIT >#115#return; 36226#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 36210#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);< 36227#$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#2(~c.base, ~c.offset, 4); 36225#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 36220#L81-1 assume true; 36207#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36214#L81-1 assume true; 36260#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36259#L81-1 assume true; 36258#func_to_recursive_line_25_to_26_0EXIT >#117#return; 36254#L81-1 assume true; 36251#func_to_recursive_line_25_to_26_0EXIT >#123#return; 36250#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; 36249#L114-2 assume !(main_~b~0#1 < 6); 36197#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; 36198#L109-2 [2024-11-08 00:34:57,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 11 times [2024-11-08 00:34:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:57,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577744931] [2024-11-08 00:34:57,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:57,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:57,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:57,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:57,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:57,457 INFO L85 PathProgramCache]: Analyzing trace with hash 711558801, now seen corresponding path program 6 times [2024-11-08 00:34:57,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:57,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716346998] [2024-11-08 00:34:57,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:57,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-11-08 00:35:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 640 [2024-11-08 00:35:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 959 [2024-11-08 00:35:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1278 [2024-11-08 00:35:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1597 [2024-11-08 00:35:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:35:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 00:35:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 161931 backedges. 19 proven. 864 refuted. 0 times theorem prover too weak. 161048 trivial. 0 not checked. [2024-11-08 00:35:07,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:35:07,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716346998] [2024-11-08 00:35:07,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716346998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:35:07,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759918941] [2024-11-08 00:35:07,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 00:35:07,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:35:07,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:35:07,121 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:35:07,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 00:35:08,298 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-08 00:35:08,298 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:35:08,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 00:35:08,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:35:08,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 00:35:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 161931 backedges. 613 proven. 3 refuted. 0 times theorem prover too weak. 161315 trivial. 0 not checked. [2024-11-08 00:35:08,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:35:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 161931 backedges. 511 proven. 4 refuted. 0 times theorem prover too weak. 161416 trivial. 0 not checked. [2024-11-08 00:35:13,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759918941] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:35:13,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:35:13,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2024-11-08 00:35:13,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168036614] [2024-11-08 00:35:13,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:35:13,449 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:35:13,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:35:13,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 00:35:13,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2024-11-08 00:35:13,450 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. cyclomatic complexity: 19 Second operand has 29 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 11 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) [2024-11-08 00:35:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:35:13,838 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2024-11-08 00:35:13,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 91 transitions. [2024-11-08 00:35:13,839 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-08 00:35:13,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 91 transitions. [2024-11-08 00:35:13,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2024-11-08 00:35:13,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2024-11-08 00:35:13,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 91 transitions. [2024-11-08 00:35:13,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:35:13,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-11-08 00:35:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 91 transitions. [2024-11-08 00:35:13,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 00:35:13,850 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-11-08 00:35:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2024-11-08 00:35:13,850 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-11-08 00:35:13,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 00:35:13,852 INFO L425 stractBuchiCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-11-08 00:35:13,852 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-08 00:35:13,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 91 transitions. [2024-11-08 00:35:13,853 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-08 00:35:13,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:35:13,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:35:13,868 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 00:35:13,868 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-11-08 00:35:13,869 INFO L745 eck$LassoCheckResult]: Stem: 60811#$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); 60784#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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(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#1(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 60776#L109-2 [2024-11-08 00:35:13,873 INFO L747 eck$LassoCheckResult]: Loop: 60776#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 60782#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 60783#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 60798#L81-1 assume true; 60785#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60792#L81-1 assume true; 60835#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60833#L81-1 assume true; 60832#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60829#L81-1 assume true; 60825#func_to_recursive_line_25_to_26_0EXIT >#123#return; 60807#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; 60808#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 60786#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 60798#L81-1 assume true; 60785#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60792#L81-1 assume true; 60835#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60833#L81-1 assume true; 60832#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60829#L81-1 assume true; 60825#func_to_recursive_line_25_to_26_0EXIT >#123#return; 60826#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; 60839#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 60787#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 60798#L81-1 assume true; 60785#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60792#L81-1 assume true; 60835#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60833#L81-1 assume true; 60832#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60829#L81-1 assume true; 60825#func_to_recursive_line_25_to_26_0EXIT >#123#return; 60827#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; 60836#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 60788#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 60798#L81-1 assume true; 60785#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60792#L81-1 assume true; 60835#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60833#L81-1 assume true; 60832#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60829#L81-1 assume true; 60825#func_to_recursive_line_25_to_26_0EXIT >#123#return; 60828#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; 60834#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 60790#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 60798#L81-1 assume true; 60785#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60792#L81-1 assume true; 60835#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60833#L81-1 assume true; 60832#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60829#L81-1 assume true; 60825#func_to_recursive_line_25_to_26_0EXIT >#123#return; 60830#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; 60831#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 60791#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60773#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~e.base, ~e.offset, 4); 60770#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~f.base, ~f.offset, 4); 60779#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 60778#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60777#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#1(~f.base, ~f.offset, 4); 60780#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 60797#L25-1 assume true; 60809#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60810#L25-1 assume true; 60845#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60844#L25-1 assume true; 60843#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60842#L25-1 assume true; 60841#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60840#L25-1 assume true; 60838#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60837#L25-1 assume true; 60824#func_to_recursive_line_28_to_28_0EXIT >#113#return; 60814#L25-1 assume true; 60813#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60769#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; 60771#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 60781#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#3(~e.base, ~e.offset, 4); 60793#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 60794#L41-1 assume true; 60795#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60802#L41-1 assume true; 60821#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60820#L41-1 assume true; 60819#func_to_recursive_line_27_to_28_0EXIT >#121#return; 60816#L41-1 assume true; 60815#func_to_recursive_line_27_to_28_0EXIT >#125#return; 60806#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60772#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60774#$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#4(~d.base, ~d.offset, 4); 60796#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 60799#L61-1 assume true; 60800#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60801#L61-1 assume true; 60812#func_to_recursive_line_26_to_27_0EXIT >#127#return; 60818#L61-1 assume true; 60817#func_to_recursive_line_26_to_27_0EXIT >#115#return; 60804#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 60789#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);< 60805#$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#2(~c.base, ~c.offset, 4); 60803#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 60798#L81-1 assume true; 60785#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60792#L81-1 assume true; 60835#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60833#L81-1 assume true; 60832#func_to_recursive_line_25_to_26_0EXIT >#117#return; 60829#L81-1 assume true; 60825#func_to_recursive_line_25_to_26_0EXIT >#123#return; 60823#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; 60822#L114-2 assume !(main_~b~0#1 < 6); 60775#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; 60776#L109-2 [2024-11-08 00:35:13,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:35:13,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 12 times [2024-11-08 00:35:13,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:35:13,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562728352] [2024-11-08 00:35:13,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:35:13,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:35:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:35:13,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:35:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:35:13,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:35:13,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:35:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash 736790991, now seen corresponding path program 7 times [2024-11-08 00:35:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:35:13,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049062685] [2024-11-08 00:35:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:35:13,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:35:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat